Sciweavers

668 search results - page 100 / 134
» Algorithmics and Applications of Tree and Graph Searching
Sort
View
TCOM
2011
170views more  TCOM 2011»
14 years 9 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...
CIVR
2009
Springer
212views Image Analysis» more  CIVR 2009»
15 years 8 months ago
Video copy detection by fast sequence matching
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
Mei-Chen Yeh, Kwang-Ting Cheng
PAMI
2008
152views more  PAMI 2008»
15 years 1 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet
GECCO
2007
Springer
180views Optimization» more  GECCO 2007»
15 years 8 months ago
Towards the coevolution of cellular automata controllers for chemical computing with the B-Z reaction
We propose that the behaviour of non-linear media can be controlled automatically through coevolutionary systems. By extension, forms of unconventional computing, i.e., massively ...
Christopher Stone, Rita Toth, Andrew Adamatzky, Be...
IPPS
2008
IEEE
15 years 8 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri