Sciweavers

1538 search results - page 187 / 308
» Spectral Techniques in Graph Algorithms
Sort
View
MIR
2003
ACM
174views Multimedia» more  MIR 2003»
15 years 6 months ago
Content-based image retrieval by clustering
In a typical content-based image retrieval (CBIR) system, query results are a set of images sorted by feature similarities with respect to the query. However, images with high fea...
Yixin Chen, James Ze Wang, Robert Krovetz
SAS
2009
Springer
147views Formal Methods» more  SAS 2009»
16 years 2 months ago
The Complexity of Andersen's Analysis in Practice
Abstract. While the tightest proven worst-case complexity for Andersen's points-to analysis is nearly cubic, the analysis seems to scale better on real-world codes. We examine...
Manu Sridharan, Stephen J. Fink
COCOON
2006
Springer
15 years 5 months ago
Fixed Linear Crossing Minimization by Reduction to the Maximum Cut Problem
Many real-life scheduling, routing and location problems can be formulated as combinatorial optimization problems whose goal is to find a linear layout of an input graph in such a ...
Christoph Buchheim, Lanbo Zheng
BIRD
2008
Springer
163views Bioinformatics» more  BIRD 2008»
15 years 3 months ago
Multi-functional Protein Clustering in PPI Networks
Abstract. Protein-Protein Interaction (PPI) networks contain valuable information for the isolation of groups of proteins that participate in the same biological function. Many pro...
Clara Pizzuti, Simona E. Rombo
EMNLP
2006
15 years 3 months ago
Learning Field Compatibilities to Extract Database Records from Unstructured Text
Named-entity recognition systems extract entities such as people, organizations, and locations from unstructured text. Rather than extract these mentions in isolation, this paper ...
Michael L. Wick, Aron Culotta, Andrew McCallum