Sciweavers

1046 search results - page 86 / 210
» Approximation Algorithms for Domination Search
Sort
View
ATAL
2007
Springer
15 years 6 months ago
Model-based function approximation in reinforcement learning
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
Nicholas K. Jong, Peter Stone
BNCOD
2007
121views Database» more  BNCOD 2007»
15 years 2 months ago
Indexing and Searching XML Documents Based on Content and Structure Synopses
We present a novel framework for indexing and searching schema-less XML documents based on concise summaries of their structural and textual content. Our search query language is X...
Weimin He, Leonidas Fegaras, David Levine
PVLDB
2008
174views more  PVLDB 2008»
15 years 18 hour ago
Relaxation in text search using taxonomies
In this paper we propose a novel document retrieval model in which text queries are augmented with multi-dimensional taxonomy restrictions. These restrictions may be relaxed at a ...
Marcus Fontoura, Vanja Josifovski, Ravi Kumar, Chr...
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
16 years 1 months ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
110
Voted
ESA
2009
Springer
167views Algorithms» more  ESA 2009»
15 years 5 months ago
Clustering-Based Bidding Languages for Sponsored Search
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
Mohammad Mahdian, Grant Wang