10988 search results - page 1750 / 2198 » Algorithmic Folding Complexity |
177
click to vote
CGF
2008
15 years 6 months ago
2008
We present a new algorithm for the efficient and reliable generation of offset surfaces for polygonal meshes. The algorithm is robust with respect to degenerate configurations and...
149
click to vote
FUIN
2008
15 years 6 months ago
2008
This paper is concerned with the universality problem for timed automata: given a timed automaton A, does A accept all timed words? Alur and Dill have shown that the universality p...
170
Voted
BMCBI
2006
15 years 6 months ago
2006
Background: A central goal of molecular biology is to understand the regulatory mechanisms of gene transcription and protein synthesis. Because of their solid basis in statistics,...
165
Voted
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
177
click to vote
BMCBI
2007
15 years 6 months ago
2007
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...