Sciweavers

133 search results - page 25 / 27
» Approximation bounds for Black Hole Search problems
Sort
View
WSDM
2010
ACM
166views Data Mining» more  WSDM 2010»
14 years 3 months ago
Ranking Mechanisms in Twitter-Like Forums
We study the problem of designing a mechanism to rank items in forums by making use of the user reviews such as thumb and star ratings. We compare mechanisms where forum users rat...
Anish Das Sarma, Atish Das Sarma, Sreenivas Gollap...
COLT
2010
Springer
13 years 3 months ago
Efficient Classification for Metric Data
Recent advances in large-margin classification of data residing in general metric spaces (rather than Hilbert spaces) enable classification under various natural metrics, such as ...
Lee-Ad Gottlieb, Leonid Kontorovich, Robert Krauth...
SIGMOD
2009
ACM
171views Database» more  SIGMOD 2009»
14 years 6 months ago
GAMPS: compressing multi sensor data by grouping and amplitude scaling
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
Sorabh Gandhi, Suman Nath, Subhash Suri, Jie Liu
CONSTRAINTS
2007
100views more  CONSTRAINTS 2007»
13 years 5 months ago
Design of Financial CDO Squared Transactions Using Constraint Programming
We give an approximate and often extremely fast method of building a particular kind of portfolio in finance, here called a portfolio design (PD), with applications in the credit ...
Pierre Flener, Justin Pearson, Luis G. Reyna, Olof...
INFOCOM
2010
IEEE
13 years 4 months ago
Information Quality Aware Routing in Event-Driven Sensor Networks
—Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/o...
Hwee-Xian Tan, Mun-Choon Chan, Wendong Xiao, Peng ...