2107 search results - page 101 / 422 » Computing Small Search Numbers in Linear Time |
146
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
146
click to vote
WAIM
2010
Springer
15 years 1 months ago
2010
Springer
Keyword search in relational databases has been widely studied in recent years. Most of the previous studies focus on how to answer an instant keyword query. In this paper, we focu...
127
Voted
TCBB
2008
15 years 3 months ago
2008
The representation of a genome by oligonucleotide probes is a prerequisite for the analysis of many of its basic properties, such as transcription factor binding sites, chromosomal...
143
click to vote
HYBRID
2004
Springer
15 years 8 months ago
2004
Springer
We present a parameter inference algorithm for autonomous stochastic linear hybrid systems, which computes a maximum-likelihood model, given only a set of continuous output data of...
115
Voted
ICS
1997
Tsinghua U.
15 years 7 months ago
1997
Tsinghua U.
Adaptive mesh re nement (AMR) is a very important scienti c application. Several libraries implementing speci c distribution policies havebeen written for AMR. In this paper, we p...