Sciweavers

2808 search results - page 490 / 562
» Routing betweenness centrality
Sort
View
INFOCOM
2011
IEEE
14 years 2 months ago
Fully secure pairwise and triple key distribution in wireless sensor networks using combinatorial designs
—We address pairwise and (for the first time) triple key establishment problems in wireless sensor networks (WSN). We use combinatorial designs to establish pairwise keys betwee...
Sushmita Ruj, Amiya Nayak, Ivan Stojmenovic
SIGMETRICS
2011
ACM
182views Hardware» more  SIGMETRICS 2011»
14 years 1 months ago
Fine-grained latency and loss measurements in the presence of reordering
Modern trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can estimate ...
Myungjin Lee, Sharon Goldberg, Ramana Rao Kompella...
CVPR
2009
IEEE
16 years 3 months ago
Distributed Volumetric Scene Geometry Reconstruction With a Network of Distributed Smart Cameras
Central to many problems in scene understanding based on using a network of tens, hundreds or even thousands of randomly distributed cameras with on-board processing and wireless c...
Shubao Liu, Kongbin Kang, Jean-Philippe Tarel and ...
91
Voted
CVPR
2004
IEEE
16 years 1 months ago
A Minimal Solution to the Generalised 3-Point Pose Problem
It is a well known classical result that given the image projections of three known world points it is possible to solve for the pose of a calibrated perspective camera to up to f...
David Nistér
ICDE
2002
IEEE
204views Database» more  ICDE 2002»
16 years 13 days ago
Approximating a Data Stream for Querying and Estimation: Algorithms and Performance Evaluation
Obtaining fast and good quality approximations to data distributions is a problem of central interest to database management. A variety of popular database applications including,...
Sudipto Guha, Nick Koudas