Sciweavers

1402 search results - page 119 / 281
» Sparse-Memory Graph Search
Sort
View
CVPR
2011
IEEE
14 years 5 months ago
Contour cut: identifying salient contours in images by solving a Hermitian eigenvalue problem
The problem of finding one-dimensional structures in images and videos can be formulated as a problem of searching for cycles in graphs. In [11], an untangling-cycle cost functio...
Ryan Kennedy, Jean Gallier, Jianbo Shi
TCOM
2011
170views more  TCOM 2011»
14 years 5 months ago
On Girth Conditioning for Low-Density Parity-Check Codes
—Low-density parity-check (LDPC) codes are gaining interest for high data rate applications in both terrestrial and spatial communications. They can be designed and studied throu...
Samuele Bandi, Velio Tralli, Andrea Conti, Maddale...
CORR
2007
Springer
108views Education» more  CORR 2007»
14 years 10 months ago
Scuba Search : when selection meets innovation
— We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality in fitness landscape....
Sébastien Vérel, Philippe Collard, M...
WWW
2002
ACM
15 years 10 months ago
Topic-sensitive PageRank
In the original PageRank algorithm for improving the ranking of search-query results, a single PageRank vector is computed, using the link structure of the Web, to capture the rel...
Taher H. Haveliwala
ECEASST
2006
305views more  ECEASST 2006»
14 years 10 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...