Sciweavers

1290 search results - page 126 / 258
» New algorithms of the Q-learning type
Sort
View
CVPR
2008
IEEE
14 years 11 months ago
Exploiting side information in locality preserving projection
Even if the class label information is unknown, side information represents some equivalence constraints between pairs of patterns, indicating whether pairs originate from the sam...
Senjian An, Wanquan Liu, Svetha Venkatesh
ICIP
2002
IEEE
14 years 10 months ago
Low complexity guaranteed fit compound document compression
We propose a new, very low complexity, single-pass, algorithm for compression of continuous tone compound documents, known as GRAFIT (GuaRAnteed FIT) that can guarantee a minimum ...
Debargha Mukherjee, Christos Chrysafis, Amir Said
WWW
2009
ACM
14 years 9 months ago
Interactive search in XML data
In a traditional keyword-search system in XML data, a user composes a keyword query, submits it to the system, and retrieves relevant subtrees. In the case where the user has limi...
Guoliang Li, Jianhua Feng, Lizhu Zhou
KDD
2006
ACM
167views Data Mining» more  KDD 2006»
14 years 9 months ago
Clustering pair-wise dissimilarity data into partially ordered sets
Ontologies represent data relationships as hierarchies of possibly overlapping classes. Ontologies are closely related to clustering hierarchies, and in this article we explore th...
Jinze Liu, Qi Zhang, Wei Wang 0010, Leonard McMill...
SASO
2009
IEEE
14 years 3 months ago
Evolution of Probabilistic Consensus in Digital Organisms
—The complexity of distributed computing systems and their increasing interaction with the physical world impose challenging requirements in terms of adaptation, robustness, and ...
David B. Knoester, Philip K. McKinley