Sciweavers

1532 search results - page 270 / 307
» Connection Relations in Mereotopology
Sort
View
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 10 months ago
Intrinsic robustness of the price of anarchy
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...
Tim Roughgarden
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
14 years 10 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
14 years 10 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal
CHI
2008
ACM
14 years 10 months ago
Mischief: supporting remote teaching in developing regions
Mischief is a system to support traditional classroom practices between a remote instructor and a group of collocated students. Meant for developing regions, each student in the c...
Neema Moraveji, Taemie Kim, James Ge, Udai Singh P...
POPL
2007
ACM
14 years 10 months ago
Preferential path profiling: compactly numbering interesting paths
Path profiles provide a more accurate characterization of a program's dynamic behavior than basic block or edge profiles, but are relatively more expensive to collect. This h...
Kapil Vaswani, Aditya V. Nori, Trishul M. Chilimbi