Sciweavers

2107 search results - page 405 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
CF
2007
ACM
14 years 25 days ago
Fast compiler optimisation evaluation using code-feature based performance prediction
Performance tuning is an important and time consuming task which may have to be repeated for each new application and platform. Although iterative optimisation can automate this p...
Christophe Dubach, John Cavazos, Björn Franke...
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 9 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...
PODC
2004
ACM
14 years 2 months ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
FOCS
1998
IEEE
14 years 1 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
RECOMB
2009
Springer
14 years 9 months ago
Storage and Retrieval of Individual Genomes
A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N. Example...
Gonzalo Navarro, Jouni Sirén, Niko Väl...