Sciweavers

233 search results - page 44 / 47
» An Investigation of Practical Approximate Nearest Neighbor A...
Sort
View
GLOBECOM
2007
IEEE
14 years 2 months ago
Optimizing P2P Streaming Throughput Under Peer Churning
Abstract— High-throughput P2P streaming relies on peer selection, the strategy a peer uses to select other peer(s) as its parent(s) of streaming. Although this problem has been t...
Yi Cui, Liang Dai, Yuan Xue
ESA
2009
Springer
167views Algorithms» more  ESA 2009»
14 years 1 months ago
Clustering-Based Bidding Languages for Sponsored Search
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
Mohammad Mahdian, Grant Wang
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 10 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
FOCS
2008
IEEE
14 years 3 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
CCCG
2003
13 years 10 months ago
On Coherent Rotation Angles for As-Rigid-As-Possible Shape Interpolation
Morphing algorithms aim to construct visually pleasing interpolations (morphs) between 2D or 3D shapes. One of the desirable properties of a morph is avoiding selfintersections of...
Jaeil Choi, Andrzej Szymczak