Sciweavers

1290 search results - page 120 / 258
» Popular Matchings: Structure and Algorithms
Sort
View
ICDE
2007
IEEE
167views Database» more  ICDE 2007»
16 years 7 months ago
GString: A Novel Approach for Efficient Search in Graph Databases
Graphs are widely used for modeling complicated data, including chemical compounds, protein interactions, XML documents, and multimedia. Information retrieval against such data ca...
Haoliang Jiang, Haixun Wang, Philip S. Yu, Shuigen...
CVPR
2007
IEEE
16 years 8 months ago
Accurate, Dense, and Robust Multi-View Stereopsis
: This paper proposes a novel algorithm for calibrated multi-view stereopsis that outputs a (quasi) dense set of rectangular patches covering the surfaces visible in the input imag...
Yasutaka Furukawa, Jean Ponce
CVPR
2008
IEEE
16 years 8 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
SWAT
1994
Springer
120views Algorithms» more  SWAT 1994»
15 years 10 months ago
Parallel Dynamic Lowest Common Ancestors
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
Erik Schenk
ECEASST
2006
305views more  ECEASST 2006»
15 years 6 months ago
The ParMol Package for Frequent Subgraph Mining
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
Thorsten Meinl, Marc Wörlein, Olga Urzova, In...