Sciweavers

3055 search results - page 258 / 611
» Randomized Search Trees
Sort
View
COMCOM
2011
14 years 10 months ago
Modeling gossip-based content dissemination and search in distributed networking
This paper presents a rigorous analytic study of gossip-based message dissemination schemes that can be employed for content/service dissemination or discovery in unstructured and...
Siyu Tang, Eva Jaho, Ioannis Stavrakakis, Ioannis ...
TSE
2010
120views more  TSE 2010»
14 years 10 months ago
Efficient Software Verification: Statistical Testing Using Automated Search
Statistical testing has been shown to be more efficient at detecting faults in software than other methods of dynamic testing such as random and structural testing. Test data are g...
Simon M. Poulding, John A. Clark
ICCV
2009
IEEE
16 years 8 months ago
Recognizing Actions by Shape-Motion Prototype Trees
A prototype-based approach is introduced for action recognition. The approach represents an action as a se- quence of prototypes for efficient and flexible action match- ing in ...
Zhe Lin, Zhuolin Jiang, Larry S. Davis
ICML
2006
IEEE
15 years 12 months ago
Cover Trees for Nearest Neighbor
We present a tree data structure for fast nearest neighbor operations in general n- point metric spaces (where the data set con- sists of n points). The data structure re- quir...
Alina Beygelzimer, Sham Kakade, John Langford
CEC
2008
IEEE
15 years 9 months ago
Increasing rule extraction accuracy by post-processing GP trees
—Genetic programming (GP), is a very general and efficient technique, often capable of outperforming more specialized techniques on a variety of tasks. In this paper, we suggest ...
Ulf Johansson, Rikard König, Tuve Löfstr...