Sciweavers

422 search results - page 67 / 85
» Protocol Specialization
Sort
View
INFOCOM
2011
IEEE
14 years 9 months ago
Approximate distance queries and compact routing in sparse graphs
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
HRI
2012
ACM
14 years 1 months ago
ROS and Rosbridge: roboticists out of the loop
The advent of ROS, the Robot Operating System, has finally made it possible to implement and use state-of-the-art navigation and manipulation algorithms on widely-available, inex...
Christopher Crick, Graylin Jay, Sarah Osentoski, O...
CVPR
2012
IEEE
13 years 8 months ago
Detecting texts of arbitrary orientations in natural images
With the increasing popularity of practical vision systems and smart phones, text detection in natural scenes becomes a critical yet challenging task. Most existing methods have f...
Cong Yao, Xiang Bai, Wenyu Liu, Yi Ma, Zhuowen Tu
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
15 years 7 months ago
Practical Private Computation and Zero-Knowledge Tools for Privacy-Preserving Distributed Data Mining
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
Yitao Duan, John F. Canny
ICDCS
2012
IEEE
13 years 8 months ago
Scaling Down Off-the-Shelf Data Compression: Backwards-Compatible Fine-Grain Mixing
—Pu and Singaravelu presented Fine-Grain Mixing, an adaptive compression system which aimed to maximize CPU and network utilization simultaneously by splitting a network stream i...
Michael Gray, Peter Peterson, Peter L. Reiher