Sciweavers

1046 search results - page 100 / 210
» Approximation Algorithms for Domination Search
Sort
View
ICML
2009
IEEE
16 years 3 months ago
Binary action search for learning continuous-action control policies
Reinforcement Learning methods for controlling stochastic processes typically assume a small and discrete action space. While continuous action spaces are quite common in real-wor...
Jason Pazis, Michail G. Lagoudakis
CIKM
2009
Springer
15 years 6 months ago
Effective, design-independent XML keyword search
Keyword search techniques that take advantage of XML structure make it very easy for ordinary users to query XML databases, but current approaches to processing these queries rely...
Arash Termehchy, Marianne Winslett
OPODIS
2004
15 years 4 months ago
Searching for a Black Hole in Tree Networks
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the t...
Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Ma...
ALENEX
2001
105views Algorithms» more  ALENEX 2001»
15 years 4 months ago
A Probabilistic Spell for the Curse of Dimensionality
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
Edgar Chávez, Gonzalo Navarro
VLDB
2007
ACM
191views Database» more  VLDB 2007»
16 years 3 months ago
Multidimensional reverse k NN search
Given a multidimensional point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for proc...
Yufei Tao, Dimitris Papadias, Xiang Lian, Xiaokui ...