Sciweavers

1403 search results - page 151 / 281
» Set cover algorithms for very large datasets
Sort
View
166
Voted
PLDI
2003
ACM
15 years 11 months ago
Points-to analysis using BDDs
This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs). In the model checking community, BDDs have been s...
Marc Berndl, Ondrej Lhoták, Feng Qian, Laur...
207
Voted
VLDB
2002
ACM
83views Database» more  VLDB 2002»
15 years 5 months ago
Searching on the Secondary Structure of Protein Sequences
In spite of the many decades of progress in database research, surprisingly scientists in the life sciences community still struggle with inefficient and awkward tools for queryin...
Laurie Hammel, Jignesh M. Patel
ICML
2005
IEEE
16 years 7 months ago
Fast condensed nearest neighbor rule
We present a novel algorithm for computing a training set consistent subset for the nearest neighbor decision rule. The algorithm, called FCNN rule, has some desirable properties....
Fabrizio Angiulli
156
Voted
BMCBI
2010
135views more  BMCBI 2010»
15 years 6 months ago
Efficient genome-scale phylogenetic analysis under the duplication-loss and deep coalescence cost models
Background: Genomic data provide a wealth of new information for phylogenetic analysis. Yet making use of this data requires phylogenetic methods that can efficiently analyze extr...
Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulens...
ICPR
2010
IEEE
15 years 4 months ago
A Re-evaluation of Pedestrian Detection on Riemannian Manifolds
Abstract--Boosting covariance data on Riemannian manifolds has proven to be a convenient strategy in a pedestrian detection context. In this paper we show that the detection perfor...
Diego Tosato, Michela Farenzena, Marco Cristani, V...