Sciweavers

2260 search results - page 149 / 452
» A new algorithm for clustering search results
Sort
View
ICPADS
2005
IEEE
16 years 1 days ago
An Efficient Partition-Based Parallel PageRank Algorithm
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
Bundit Manaskasemsak, Arnon Rungsawang
ICDE
2008
IEEE
162views Database» more  ICDE 2008»
16 years 7 months ago
Adaptive Approximate Similarity Searching through Metric Social Networks
Exploiting the concepts of social networking represents a novel approach to the approximate similarity query processing. We present a metric social network where relations between...
Jan Sedmidubský, Pavel Zezula, Stanislav Ba...
MMDB
2004
ACM
148views Multimedia» more  MMDB 2004»
15 years 12 months ago
A unified framework for image database clustering and content-based retrieval
With the proliferation of image data, the need to search and retrieve images efficiently and accurately from a large image database or a collection of image databases has drastica...
Mei-Ling Shyu, Shu-Ching Chen, Min Chen, Chengcui ...
RECOMB
2007
Springer
16 years 6 months ago
Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking
The study of biological networks and network motifs can yield significant new insights into systems biology. Previous methods of discovering network motifs ? network-centric subgra...
Joshua A. Grochow, Manolis Kellis
CVPR
2008
IEEE
16 years 27 days ago
Partitioning of image datasets using discriminative context information
We propose a new method to partition an unlabeled dataset, called Discriminative Context Partitioning (DCP). It is motivated by the idea of splitting the dataset based only on how...
Christoph H. Lampert