Sciweavers

2434 search results - page 404 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
116
Voted
CVPR
2008
IEEE
16 years 2 months ago
Precise detailed detection of faces and facial features
Face detection has advanced dramatically over the past three decades. Algorithms can now quite reliably detect faces in clutter in or near real time. However, much still needs to ...
Liya Ding, Aleix M. Martínez
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
16 years 21 days ago
Discovering bucket orders from full rankings
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
Jianlin Feng, Qiong Fang, Wilfred Ng
141
Voted
PODS
2007
ACM
225views Database» more  PODS 2007»
16 years 21 days ago
Sketching unaggregated data streams for subpopulation-size queries
IP packet streams consist of multiple interleaving IP flows. Statistical summaries of these streams, collected for different measurement periods, are used for characterization of ...
Edith Cohen, Nick G. Duffield, Haim Kaplan, Carste...
100
Voted
SODA
2010
ACM
371views Algorithms» more  SODA 2010»
15 years 10 months ago
Online Learning with Queries
The online learning problem requires a player to iteratively choose an action in an unknown and changing environment. In the standard setting of this problem, the player has to ch...
Chao-Kai Chiang, Chi-Jen Lu
121
Voted
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
15 years 10 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...