Sciweavers

1554 search results - page 246 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
XSYM
2004
Springer
115views Database» more  XSYM 2004»
15 years 5 months ago
XQuery Processing with Relevance Ranking
Abstract. We are presenting a coherent framework for XQuery processing that incorporates IR-style approximate matching and allows the ordering of results by their relevance score. ...
Leonidas Fegaras
SIGGRAPH
2010
ACM
15 years 4 months ago
Rigid-body fracture sound with precomputed soundbanks
We propose a physically based algorithm for synthesizing sounds synchronized with brittle fracture animations. Motivated by laboratory experiments, we approximate brittle fracture...
Changxi Zheng, Doug L. James
ICRA
2000
IEEE
180views Robotics» more  ICRA 2000»
15 years 4 months ago
Interactive Motion Planning Using Hardware-Accelerated Computation of Generalized Voronoi Diagrams
We present techniques for fast motion planning by using discrete approximations of generalized Voronoi diagrams, computed with graphics hardware. Approaches based on this diagram ...
Kenneth E. Hoff III, Tim Culver, John Keyser, Ming...
STACS
1999
Springer
15 years 4 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
ECAI
2006
Springer
15 years 3 months ago
Least Squares SVM for Least Squares TD Learning
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
Tobias Jung, Daniel Polani