Sciweavers

8331 search results - page 1666 / 1667
» Data Aggregation Sets in Adaptive Data Model
Sort
View
WWW
2011
ACM
13 years 21 days ago
Pragmatic evaluation of folksonomies
Recently, a number of algorithms have been proposed to obtain hierarchical structures — so-called folksonomies — from social tagging data. Work on these algorithms is in part ...
Denis Helic, Markus Strohmaier, Christoph Trattner...
TON
2010
167views more  TON 2010»
13 years 14 days ago
A Machine Learning Approach to TCP Throughput Prediction
TCP throughput prediction is an important capability in wide area overlay and multi-homed networks where multiple paths may exist between data sources and receivers. In this paper...
Mariyam Mirza, Joel Sommers, Paul Barford, Xiaojin...
TSP
2010
13 years 14 days ago
Compressed sensing performance bounds under Poisson noise
Abstract--This paper describes performance bounds for compressed sensing (CS) where the underlying sparse or compressible (sparsely approximable) signal is a vector of nonnegative ...
Maxim Raginsky, Rebecca Willett, Zachary T. Harman...
3DIM
2011
IEEE
12 years 5 months ago
A Non-cooperative Game for 3D Object Recognition in Cluttered Scenes
Abstract—During the last few years a wide range of algorithms and devices have been made available to easily acquire range images. To this extent, the increasing abundance of dep...
Andrea Albarelli, Emanuele Rodolà, Filippo ...
PPOPP
2012
ACM
12 years 1 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
« Prev « First page 1666 / 1667 Last » Next »