Sciweavers

1604 search results - page 246 / 321
» Approximation algorithms for developable surfaces
Sort
View
VLDB
2007
ACM
105views Database» more  VLDB 2007»
14 years 3 months ago
Extending Q-Grams to Estimate Selectivity of String Matching with Low Edit Distance
There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used s...
Hongrae Lee, Raymond T. Ng, Kyuseok Shim
CSB
2004
IEEE
110views Bioinformatics» more  CSB 2004»
14 years 19 days ago
SPIDER: Software for Protein Identification from Sequence Tags with De Novo Sequencing Error
For the identification of novel proteins using MS/MS, de novo sequencing software computes one or several possible amino acid sequences (called sequence tags) for each MS/MS spect...
Yonghua Han, Bin Ma, Kaizhong Zhang
TSP
2008
143views more  TSP 2008»
13 years 8 months ago
Sparse Representation in Structured Dictionaries With Application to Synthetic Aperture Radar
Sparse signal representations and approximations from overcomplete dictionaries have become an invaluable tool recently. In this paper, we develop a new, heuristic, graph-structure...
Kush R. Varshney, Müjdat Çetin, John W...
CONSTRAINTS
1998
112views more  CONSTRAINTS 1998»
13 years 8 months ago
Temporal Constraints: A Survey
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
Eddie Schwalb, Lluís Vila
SIGSOFT
2008
ACM
14 years 9 months ago
Semi-automating small-scale source code reuse via structural correspondence
Developers perform small-scale reuse tasks to save time and to increase the quality of their code, but due to their small scale, the costs of such tasks can quickly outweigh their...
Rylan Cottrell, Robert J. Walker, Jörg Denzin...