Sciweavers

130 search results - page 13 / 26
» The Quantum Communication Complexity of Sampling
Sort
View
INFOCOM
2012
IEEE
12 years 12 months ago
Sampling directed graphs with random walks
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
Bruno F. Ribeiro, Pinghui Wang, Fabricio Murai, Do...
TOG
2012
582views Communications» more  TOG 2012»
12 years 12 months ago
Synthesis of detailed hand manipulations using contact sampling
Capturing human activities that involve both gross full-body motion and detailed hand manipulation of objects is challenging for standard motion capture systems. We introduce a ne...
Yuting Ye, C. Karen Liu
78
Voted
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 2 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
TCOM
2010
61views more  TCOM 2010»
14 years 8 months ago
Variable-rate M-PSK communications without channel amplitude estimation
—Channel estimation at the receiver side is essential to adaptive modulation schemes, prohibiting low complexity systems from using variable rate and/or variable power transmissi...
Athanasios S. Lioumpas, George K. Karagiannidis
92
Voted
SSDBM
2006
IEEE
139views Database» more  SSDBM 2006»
15 years 3 months ago
Sampling Trajectory Streams with Spatiotemporal Criteria
Monitoring movement of high-dimensional points is essential for environmental databases, geospatial applications, and biodiversity informatics as it reveals crucial information ab...
Michalis Potamias, Kostas Patroumpas, Timos K. Sel...