Sciweavers

1110 search results - page 88 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
NA
2010
85views more  NA 2010»
14 years 9 months ago
The reliability/cost trade-off for a class of ODE solvers
In the numerical solution of ODEs, it is now possible to develop efficient techniques that will deliver approximate solutions that are piecewise polynomials. The resulting methods...
Wayne H. Enright, Li Yan
CORR
2010
Springer
67views Education» more  CORR 2010»
14 years 9 months ago
Maintaining Virtual Areas on FPGAs using Strip Packing with Delays
—Every year the computing resources available on dynamically partially reconfigurable devices increase enormously. In the near future, we expect many applications to run on a si...
Josef Angermeier, Sándor P. Fekete, Tom Kam...
BMCBI
2006
90views more  BMCBI 2006»
14 years 11 months ago
The PowerAtlas: a power and sample size atlas for microarray experimental design and research
Background: Microarrays permit biologists to simultaneously measure the mRNA abundance of thousands of genes. An important issue facing investigators planning microarray experimen...
Grier P. Page, Jode W. Edwards, Gary L. Gadbury, P...
STACS
2010
Springer
15 years 6 months ago
Long Non-crossing Configurations in the Plane
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...
Noga Alon, Sridhar Rajagopalan, Subhash Suri
FLAIRS
2008
15 years 1 months ago
Paraphrase Identification with Lexico-Syntactic Graph Subsumption
The paper presents a new approach to the problem of paraphrase identification. The new approach extends a previously proposed method for the task of textual entailment. The relati...
Vasile Rus, Philip M. McCarthy, Mihai C. Lintean, ...