Sciweavers

7773 search results - page 1207 / 1555
» On generalized Frame-Stewart numbers
Sort
View
COCOA
2008
Springer
15 years 8 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
Shai Gutner
CCS
2010
ACM
15 years 8 months ago
Securing wireless sensor networks against large-scale node capture attacks
Securing wireless sensor networks against node capture is a challenging task. All well-known random key pre-distribution systems, including the Eschenauer and Gligor's pionee...
Tuan Manh Vu, Reihaneh Safavi-Naini, Carey William...
BMCBI
2010
132views more  BMCBI 2010»
15 years 7 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...
184
Voted
COGSCI
2008
139views more  COGSCI 2008»
15 years 7 months ago
A Computational Model of Early Argument Structure Acquisition
How children go about learning the general regularities that govern language, as well as keeping track of the exceptions to them, remains one of the challenging open questions in ...
Afra Alishahi, Suzanne Stevenson
216
Voted
COMPUTING
2008
174views more  COMPUTING 2008»
15 years 7 months ago
Multilevel algorithms for Rannacher-Turek finite element approximation of 3D elliptic problems
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
Ivan Georgiev, Johannes Kraus, Svetozar Margenov
« Prev « First page 1207 / 1555 Last » Next »