Sciweavers

6976 search results - page 313 / 1396
» The Oil Searching Problem
Sort
View
COMPGEOM
2010
ACM
15 years 11 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park
TKDE
2008
136views more  TKDE 2008»
15 years 6 months ago
Efficient Correlation Search from Graph Databases
Correlation mining has gained great success in many application domains for its ability to capture underlying dependencies between objects. However, research on correlation mining ...
Yiping Ke, James Cheng, Wilfred Ng
ICML
2003
IEEE
16 years 7 months ago
The Cross Entropy Method for Fast Policy Search
We present a learning framework for Markovian decision processes that is based on optimization in the policy space. Instead of using relatively slow gradient-based optimization al...
Shie Mannor, Reuven Y. Rubinstein, Yohai Gat
SAC
2005
ACM
16 years 8 days ago
On search in peer-to-peer file sharing systems
We consider the problem of information retrieval in a peerto-peer file sharing system. We assume that peers are unreliable, metadata are sparse, and queries are short. In light o...
Wai Gen Yee, Ophir Frieder
ECAI
2004
Springer
16 years 3 days ago
Tractable Symmetry Breaking Using Restricted Search Trees
We present a new conceptual abstraction in symmetry breaking – the GE-tree. The construction and traversal of a GE-tree breaks all symmetries in any constraint satisfaction or si...
Colva M. Roney-Dougal, Ian P. Gent, Tom Kelsey, St...