Sciweavers

2260 search results - page 133 / 452
» A new algorithm for clustering search results
Sort
View
CP
1995
Springer
15 years 10 months ago
Asynchronous Weak-commitment Search for Solving Distributed Constraint Satisfaction Problems
A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application...
Makoto Yokoo
ICDE
2006
IEEE
191views Database» more  ICDE 2006»
16 years 7 months ago
Query Decomposition: A Multiple Neighborhood Approach to Relevance Feedback Processing in Content-based Image Retrieval
Today's Content-Based Image Retrieval (CBIR) techniques are based on the "k-nearest neighbors" (kNN) model. They retrieve images from a single neighborhood using lo...
Kien A. Hua, Ning Yu, Danzhou Liu
CIBCB
2008
IEEE
16 years 27 days ago
An information theoretic approach for the discovery of irregular and repetitive patterns in genomic data
sequence content at an abstract level and offers novel ways to examine the information contained in them. Our approach is an information theoretic search process which uses patter...
Willard Davis, Ananth Kalyanaraman, Diane J. Cook
ICC
2007
IEEE
16 years 22 days ago
Speed Up Queries in Unstructured Peer-to-Peer Networks
—Unstructured peer-to-peer networks have gained a lot of popularity due to their resilience to network dynamics. The core operation in such networks is to efficiently locate res...
Zhan Zhang, Yong Tang, Shigang Chen
AUSAI
2010
Springer
15 years 3 months ago
A Heuristic on Effective and Efficient Clustering on Uncertain Objects
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
Edward Hung, Lei Xu, Chi-Cheong Szeto