Sciweavers

1763 search results - page 222 / 353
» Dependent random choice
Sort
View
WADS
2007
Springer
82views Algorithms» more  WADS 2007»
14 years 2 months ago
On a Family of Strong Geometric Spanners That Admit Local Routing Strategies
We introduce a family of directed geometric graphs, denoted Gθ λ, that depend on two parameters λ and θ. For 0 ≤ θ < π 2 and 1 2 < λ < 1, the Gθ λ graph is a s...
Prosenjit Bose, Paz Carmi, Mathieu Couture, Michie...
DSD
2006
IEEE
114views Hardware» more  DSD 2006»
14 years 2 months ago
Improved Precision of Coarse Grained Localization in Wireless Sensor Networks
In wireless sensor networks, the coarse grained localization is a method to compute the position of randomly distributed sensor nodes. Without optimizations, it provides low preci...
Frank Reichenbach, Jan Blumenthal, Dirk Timmermann
ICDCS
2005
IEEE
14 years 1 months ago
On the Impact of Replica Placement to the Reliability of Distributed Brick Storage Systems
Data reliability of distributed brick storage systems critically depends on the replica placement policy, and the two governing forces are repair speed and sensitivity to multiple...
Qiao Lian, Wei Chen, Zheng Zhang
COMPGEOM
2004
ACM
14 years 1 months ago
Range counting over multidimensional data streams
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
Subhash Suri, Csaba D. Tóth, Yunhong Zhou
ICML
2004
IEEE
14 years 1 months ago
Learning to learn with the informative vector machine
This paper describes an ecient method for learning the parameters of a Gaussian process (GP). The parameters are learned from multiple tasks which are assumed to have been drawn ...
Neil D. Lawrence, John C. Platt