Sciweavers

3055 search results - page 256 / 611
» Randomized Search Trees
Sort
View
COMPGEOM
1992
ACM
15 years 10 months ago
On-Line Steiner Trees in the Euclidean Plane
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
Noga Alon, Yossi Azar
JCIT
2008
129views more  JCIT 2008»
15 years 6 months ago
An Enhanced tree based MAODV Protocol for MANETs using Genetic Algorithm
Multicast routing protocols in Mobile Ad-hoc Networks (MANETs) are emerging for wireless group communication which includes application such as multipoint data dissemination and m...
E. Baburaj, V. Vasudevan
CP
2007
Springer
16 years 21 days ago
On Universal Restart Strategies for Backtracking Search
Abstract. Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that a technique called randomi...
Huayue Wu, Peter van Beek
ETRA
2006
ACM
128views Biometrics» more  ETRA 2006»
16 years 15 days ago
An eye tracking interface for image search
This paper explores the feasibility of using an eye tracker as an image retrieval interface. A database of image similarity values between 1000 Corel images is used in the study. ...
Oyewole Oyekoya, Fred Stentiford
UC
2005
Springer
16 years 8 hour ago
Quantum Searching Amidst Uncertainty
Consider a database most of whose entries are marked but the precise fraction of marked entries is not known. What is known is that the fraction of marked entries is 1 − , where ...
Lov K. Grover