Select a calendar:
Filter October Events by Event Type:
SUNMONTUEWEDTHUFRISAT
Events for October 02, 2007
-
EBay Architecture †Balancing site stability, feature velocity, cost, and performance
Tue, Oct 02, 2007 @ 10:30 AM - 11:30 AM
Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
eBay Inc. has interesting challenges around scaling, choice of technologies, and implementation specifics. eBay's search engine is one of the largest and most complex information retrieval machines in the world. eBay operates tens of thousands of servers in locations all over the globe and coordinates their activities from a single location by employing a grid-style architecture. eBay has a variety of research initiatives in Web 2.0, statistical modeling, machine learning, etc., in addition to traditional software development tracts which are Java/C++ based. This talk will give an overview of some of the inner workings of the eBay stack, and of the eBay work environment.Speaker: Mahesh Tyagarajan is a Sr. Manager, Application Architecture, at eBay Inc. Mahesh is an Enterprise Architect with significant industry experience in various technology companies including eBay, Bell Labs (Lucent), and Netscape.Hosted by Prof. Viktor Prasanna
Location: Hughes Aircraft Electrical Engineering Center (EEB) - 248
Audiences: Everyone Is Invited
Contact: Annie Yu
-
Performance Improvements and Hardness Results for LDPC
Tue, Oct 02, 2007 @ 02:00 PM - 03:00 PM
Ming Hsieh Department of Electrical and Computer Engineering
Conferences, Lectures, & Seminars
SPEAKER: Professor Priti Shankar, Indian Institute of ScienceAbstract: A random combinatorial construction for near-regular LDPC codes is proposed. Near-regularity implies that the left or right degree of a node varies by at most one from the average left or right degree respectively. Bounds on achievable girth are derived. Experimental results indicate that these codes perform somewhat better than the well known regular Progressive Edge Growth (PEG) codes. The notion of node credibility is defined and used to modify the sum-product decoding algorithm. Performance improvements in the waterfall region are observed using this modification. Finally it is shown that computing the stopping distance of LDPC codes is computationally intractable.Bio: Priti Shankar is in the Department of Computer Science and Automation at the Indian Institute of Science, where she is currently Professor. Her interests are in algorithmic coding theory, automata and computability, and compiler theory.Host: Professor P. Vijay Kumar, vijayk@usc.edu
Location: Hughes Aircraft Electrical Engineering Center (EEB) - 248
Audiences: Everyone Is Invited
Contact: Mayumi Thrasher
