Sciweavers

2412 search results - page 249 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
156
Voted
FOCS
2000
IEEE
15 years 8 months ago
Extracting Randomness from Samplable Distributions
Randomness extractors convert weak sources of randomness into an almost uniform distribution; the conversion uses a small amount of pure randomness. In algorithmic applications, t...
Luca Trevisan, Salil P. Vadhan
144
Voted
BMCBI
2007
145views more  BMCBI 2007»
15 years 3 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...
139
Voted
CGF
2007
156views more  CGF 2007»
15 years 3 months ago
Automatic Light Source Placement for Maximum Visual Information Recovery
The automatic selection of good viewing parameters is a very complex problem. In most cases, the notion of good strongly depends on the concrete application. Moreover, when an int...
Pere-Pau Vázquez
137
Voted
SIGSOFT
2008
ACM
16 years 4 months ago
Latent social structure in open source projects
Commercial software project managers design project organizational structure carefully, mindful of available skills, division of labour, geographical boundaries, etc. These organi...
Christian Bird, David S. Pattison, Raissa M. D'Sou...
127
Voted
LICS
2002
IEEE
15 years 8 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin