Sciweavers

4894 search results - page 650 / 979
» The Guarding Problem - Complexity and Approximation
Sort
View
SDM
2007
SIAM
145views Data Mining» more  SDM 2007»
15 years 5 months ago
Finding Motifs in a Database of Shapes
The problem of efficiently finding images that are similar to a target image has attracted much attention in the image processing community and is rightly considered an informatio...
Xiaopeng Xi, Eamonn J. Keogh, Li Wei, Agenor Mafra...
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 5 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro
AAAI
1998
15 years 5 months ago
Applying Online Search Techniques to Continuous-State Reinforcement Learning
In this paper, we describe methods for e ciently computing better solutions to control problems in continuous state spaces. We provide algorithms that exploit online search to boo...
Scott Davies, Andrew Y. Ng, Andrew W. Moore
WSCG
2000
93views more  WSCG 2000»
15 years 5 months ago
Real-time Animation Technique for Flexible and Thin Objects
In this paper, we propose an e cient technique for the animation of exible thin objects. Massspring model was employed to represent the exible objects. Many techniques have used t...
Young-Min Kang, Jeong-Hyeon Choi, Hwan-Gue Cho, Do...
ICASSP
2010
IEEE
15 years 4 months ago
Multiantenna spectrum sensing: Detection of spatial correlation among time-series with unknown spectra
One of the key problems in cognitive radio (CR) is the detection of primary activity in order to determine which parts of the spectrum are available for opportunistic access. This...
David Ramírez, Javier Vía, Ignacio S...