Sciweavers

9842 search results - page 1350 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ILP
2007
Springer
16 years 1 months ago
Learning Relational Options for Inductive Transfer in Relational Reinforcement Learning
In reinforcement learning problems, an agent has the task of learning a good or optimal strategy from interaction with his environment. At the start of the learning task, the agent...
Tom Croonenborghs, Kurt Driessens, Maurice Bruynoo...
WAIM
2007
Springer
16 years 1 months ago
Building Data Synopses Within a Known Maximum Error Bound
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
CBMS
2006
IEEE
16 years 1 months ago
Efficient Rotation Invariant Retrieval of Shapes with Applications in Medical Databases
Recognition of shapes in images is an important problem in computer vision with application in various medical problems, including robotic surgery and cell analysis. The similarit...
Selina Chu, Shrikanth S. Narayanan, C. C. Jay Kuo
ADC
2006
Springer
158views Database» more  ADC 2006»
16 years 1 months ago
Dimensionality reduction in patch-signature based protein structure matching
Searching bio-chemical structures is becoming an important application domain of information retrieval. This paper introduces a protein structure matching problem and formulates i...
Zi Huang, Xiaofang Zhou, Dawei Song, Peter Bruza
COMPGEOM
2006
ACM
16 years 1 months ago
Vines and vineyards by updating persistence in linear time
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy...
« Prev « First page 1350 / 1969 Last » Next »