Sciweavers

398 search results - page 76 / 80
» Ant Algorithm for the Graph Matching Problem
Sort
View
BMCBI
2006
120views more  BMCBI 2006»
13 years 7 months ago
Projections for fast protein structure retrieval
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...
CIKM
2007
Springer
14 years 1 months ago
Evaluation of partial path queries on xml data
XML query languages typically allow the specification of structural patterns of elements. Finding the occurrences of such patterns in an XML tree is the key operation in XML quer...
Stefanos Souldatos, Xiaoying Wu, Dimitri Theodorat...
FPGA
2010
ACM
232views FPGA» more  FPGA 2010»
13 years 7 months ago
High-throughput bayesian computing machine with reconfigurable hardware
We use reconfigurable hardware to construct a high throughput Bayesian computing machine (BCM) capable of evaluating probabilistic networks with arbitrary DAG (directed acyclic gr...
Mingjie Lin, Ilia Lebedev, John Wawrzynek
WWW
2005
ACM
14 years 8 months ago
G-ToPSS: fast filtering of graph-based metadata
RDF is increasingly being used to represent metadata. RDF Site Summary (RSS) is an application of RDF on the Web that has considerably grown in popularity. However, the way RSS sy...
Milenko Petrovic, Haifeng Liu, Hans-Arno Jacobsen
MM
2010
ACM
211views Multimedia» more  MM 2010»
13 years 7 months ago
Artistic paper-cut of human portraits
This paper presents a method to render artistic paper-cut of human portraits. Rendering paper-cut images from photographs can be considered as an inhomogeneous image binarization ...
Meng Meng, Mingtian Zhao, Song Chun Zhu