Sciweavers

2088 search results - page 238 / 418
» The Probabilistic Method
Sort
View
129
Voted
CJ
2002
67views more  CJ 2002»
15 years 3 months ago
Using Bloom Filters to Speed-up Name Lookup in Distributed Systems
Bloom filters make use of a "probabilistic" hash-coding method to reduce the amount of space required to store a hash set. A Bloom filter offers a trade-off between its ...
Mark C. Little, Santosh K. Shrivastava, Neil A. Sp...
142
Voted
EMMCVPR
2011
Springer
14 years 3 months ago
Optimality Bounds for a Variational Relaxation of the Image Partitioning Problem
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...
Jan Lellmann, Frank Lenzen, Christoph Schnörr
164
Voted
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
15 years 9 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
138
Voted
CHI
2008
ACM
15 years 5 months ago
Introducing item response theory for measuring usability inspection processes
Usability evaluation methods have a long history of research. Latest contributions significantly raised the validity of method evaluation studies. But there is still a measurement...
Martin Schmettow, Wolfgang Vietze
152
Voted
COLCOM
2007
IEEE
15 years 10 months ago
Collaborative motion planning of autonomous robots
—In disaster areas, office buildings, or at home, multiple autonomous networked mobile robots may act instead of human beings. These robots have to move to their destination so ...
Takashi Okada, Razvan Beuran, Junya Nakata, Yasuo ...