32545 search results - page 487 / 6509 » Data Structures and Algorithms |
194
click to vote
BMCBI
2010
15 years 7 months ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
227
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
Recent work has demonstrated that using a carefully designed dictionary instead of a predefined one, can improve the sparsity in jointly representing a class of signals. This has m...
217
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
This paper studies the problem of extracting data from a Web page that contains several structured data records. The objective is to segment these data records, extract data items...
232
click to vote
CGO
2011
IEEE
14 years 11 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
197
click to vote
EJC
2003
15 years 8 months ago
2003
The goal of this paper is to build a bridge from a certain intuitive conception of natural language communication, called the SLIM theory of language, to a technical approach, cal...