Sciweavers

45 search results - page 9 / 9
» A SAT-based polynomial space algorithm for answer set progra...
Sort
View
COMPGEOM
2003
ACM
13 years 10 months ago
Cache-oblivious data structures for orthogonal range searching
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan...
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 4 months ago
The Power of Nondeterminism in Self-Assembly
tigate the role of nondeterminism in Winfree's abstract Tile Assembly Model (aTAM), which was conceived to model artificial molecular self-assembling systems constructed from...
Nathaniel Bryans, Ehsan Chiniforooshan, David Doty...
ORL
1998
116views more  ORL 1998»
13 years 4 months ago
Heuristic solution of the multisource Weber problem as a p-median problem
Good heuristic solutions for large Multisource Weber problems can be obtained by solving related p-median problems in which potential locations of the facilities are users location...
Pierre Hansen, Nenad Mladenovic, Éric D. Ta...
PLDI
2009
ACM
13 years 11 months ago
TAJ: effective taint analysis of web applications
Taint analysis, a form of information-flow analysis, establishes whether values from untrusted methods and parameters may flow into security-sensitive operations. Taint analysis...
Omer Tripp, Marco Pistoia, Stephen J. Fink, Manu S...
BMCBI
2006
159views more  BMCBI 2006»
13 years 4 months ago
MultiSeq: unifying sequence and structure data for evolutionary analysis
Background: Since the publication of the first draft of the human genome in 2000, bioinformatic data have been accumulating at an overwhelming pace. Currently, more than 3 million...
Elijah Roberts, John Eargle, Dan Wright, Zaida Lut...