Sciweavers

1813 search results - page 79 / 363
» Calculi of Approximation Spaces
Sort
View
SISAP
2010
IEEE
159views Data Mining» more  SISAP 2010»
15 years 4 months ago
CP-index: using clustering and pivots for indexing non-metric spaces
Most multimedia information retrieval systems use an indexing scheme to speed up similarity search. The index aims to discard large portions of the data collection at query time. ...
Victor Sepulveda, Benjamin Bustos
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
16 years 6 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
CGI
1998
IEEE
15 years 10 months ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...
IWANN
1999
Springer
15 years 10 months ago
Using Temporal Neighborhoods to Adapt Function Approximators in Reinforcement Learning
To avoid the curse of dimensionality, function approximators are used in reinforcement learning to learn value functions for individual states. In order to make better use of comp...
R. Matthew Kretchmar, Charles W. Anderson
ICML
2008
IEEE
16 years 7 months ago
Accurate max-margin training for structured output spaces
Tsochantaridis et al. (2005) proposed two formulations for maximum margin training of structured spaces: margin scaling and slack scaling. While margin scaling has been extensivel...
Sunita Sarawagi, Rahul Gupta