Sciweavers

2107 search results - page 191 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
158
Voted
ACL
2008
15 years 5 months ago
Pairwise Document Similarity in Large Collections with MapReduce
This paper presents a MapReduce algorithm for computing pairwise document similarity in large document collections. MapReduce is an attractive framework because it allows us to de...
Tamer Elsayed, Jimmy J. Lin, Douglas W. Oard
CCCG
1998
15 years 5 months ago
Proximity drawings of binary trees in polynomial area
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
Paolo Penna, Paola Vocca
SIPS
2007
IEEE
15 years 10 months ago
A Fast Mode Decision Algorithm for H.264/AVC Intra Prediction
In this paper, we present a fast mode decision algorithm for H.264/AVC intra prediction. The goal of this work is to reduce computational complexity of the H.264 encoder without s...
Ling-Jiao Pan, Yo-Sung Ho
BMCBI
2005
132views more  BMCBI 2005»
15 years 3 months ago
Kalign - an accurate and fast multiple sequence alignment algorithm
Background: The alignment of multiple protein sequences is a fundamental step in the analysis of biological data. It has traditionally been applied to analyzing protein families f...
Timo Lassmann, Erik L. L. Sonnhammer
COCOON
2003
Springer
15 years 9 months ago
On a Conjecture on Wiener Indices in Combinatorial Chemistry
Drugs and other chemical compounds are often modeled as polygonal shapes, where each vertex represents an atom of the molecule, and covalent bonds between atoms are represented by...
Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. ...