Sciweavers

1095 search results - page 103 / 219
» Preprocessing of Intractable Problems
Sort
View
ICIP
2002
IEEE
14 years 12 months ago
Fingerprint matching based on error propagation
Fingerprint matching is one of the most important modules in automatic fingerprint identification systems (AFIS). Traditional methods treat this problem as point pattern matching,...
Ying Hao, Tieniu Tan, Yunhong Wang
ICDE
2008
IEEE
195views Database» more  ICDE 2008»
14 years 11 months ago
LOCUST: An Online Analytical Processing Framework for High Dimensional Classification of Data Streams
Abstract-- In recent years, data streams have become ubiquitous because of advances in hardware and software technology. The ability to adapt conventional mining problems to data s...
Charu C. Aggarwal, Philip S. Yu
ICML
2007
IEEE
14 years 11 months ago
A novel orthogonal NMF-based belief compression for POMDPs
High dimensionality of POMDP's belief state space is one major cause that makes the underlying optimal policy computation intractable. Belief compression refers to the method...
Xin Li, William Kwok-Wai Cheung, Jiming Liu, Zhili...
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
14 years 10 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
PODS
2007
ACM
196views Database» more  PODS 2007»
14 years 10 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul