Sciweavers

3055 search results - page 347 / 611
» Randomized Search Trees
Sort
View
104
Voted
SAC
2006
ACM
15 years 9 months ago
Evaluating unstructured peer-to-peer lookup overlays
Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...
Idit Keidar, Roie Melamed
132
Voted
GECCO
2005
Springer
154views Optimization» more  GECCO 2005»
15 years 9 months ago
Genetic algorithms using low-discrepancy sequences
The random number generator is one of the important components of evolutionary algorithms (EAs). Therefore, when we try to solve function optimization problems using EAs, we must ...
Shuhei Kimura, Koki Matsumura
132
Voted
CVPR
2010
IEEE
15 years 9 months ago
Facial Point Detection using Boosted Regression and Graph Models
Finding fiducial facial points in any frame of a video showing rich naturalistic facial behaviour is an unsolved problem. Yet this is a crucial step for geometric-featurebased fa...
Michel Valstar, Brais Martinez, Xavier Binefa, Maj...
106
Voted
BIBE
2007
IEEE
134views Bioinformatics» more  BIBE 2007»
15 years 10 months ago
Bottom-Up Multiple Row Addition Algorithms for the Biclustering-Problem
Abstract—The discovery of locally and significantly correlated subpatterns within a two-dimensional dataset has recently become quite popular and is amongst others addressed by ...
Hyung-Won Koh, Lars Hildebrand
117
Voted
ROBOCOMM
2007
IEEE
15 years 10 months ago
Achieving connectivity through coalescence in mobile robot networks
—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
Sameera Poduri, Gaurav S. Sukhatme