Sciweavers

173 search results - page 30 / 35
» An optimal randomized algorithm for maximum Tukey depth
Sort
View
SIGECOM
2009
ACM
216views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
Approximate mechanism design without money
The literature on algorithmic mechanism design is mostly concerned with game-theoretic versions of optimization problems to which standard economic money-based mechanisms cannot b...
Ariel D. Procaccia, Moshe Tennenholtz
ICML
2008
IEEE
14 years 8 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
VLDB
2004
ACM
134views Database» more  VLDB 2004»
14 years 27 days ago
Memory-Limited Execution of Windowed Stream Joins
We address the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join...
Utkarsh Srivastava, Jennifer Widom
CVPR
2005
IEEE
14 years 9 months ago
Object Detection Using 2D Spatial Ordering Constraints
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...
Yan Li, Yanghai Tsin, Yakup Genc, Takeo Kanade
GIS
2004
ACM
14 years 8 months ago
Energy efficient exact kNN search in wireless broadcast environments
The advances in wireless communication and decreasing costs of mobile devices have enabled users to access desired information at any time. Coupled with positioning technologies l...
Bugra Gedik, Aameek Singh, Ling Liu