Sciweavers

8298 search results - page 1658 / 1660
» On the Complexity of Numerical Analysis
Sort
View
INFOCOM
2012
IEEE
11 years 9 months ago
Cuckoo sampling: Robust collection of flow aggregates under a fixed memory budget
—Collecting per-flow aggregates in high-speed links is challenging and usually requires traffic sampling to handle peak rates and extreme traffic mixes. Static selection of sa...
Josep Sanjuàs-Cuxart, Pere Barlet-Ros, Nick...
CVPR
2012
IEEE
11 years 9 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 9 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
PODC
2009
ACM
14 years 7 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
ICRA
2009
IEEE
176views Robotics» more  ICRA 2009»
14 years 1 months ago
Rollin' Justin - Mobile platform with variable base
Abstract— Research on humanoid robots for use in servicing tasks, e.g. fetching and delivery, attracts steadily more interest. With ”Rollin’ Justin” a mobile robotic system...
Christoph Borst, Thomas Wimböck, Florian Schm...
« Prev « First page 1658 / 1660 Last » Next »