3320 search results - page 556 / 664 » Heuristics for the Phylogeny Problem |
ISPD
1999
ACM
14 years 1 months ago
1999
ACM
—Maze routing algorithms are widely used for finding an optimal path in detailed routing for very large scale integration, printed circuit board and multichip modules In this pap...
SIGMOD
1999
ACM
14 years 1 months ago
1999
ACM
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
ICCAD
1999
IEEE
14 years 1 months ago
1999
IEEE
This paper presents a new method to synthesize timed asynchronous circuits directly from the specification without generating a state graph. The synthesis procedure begins with a ...
ICCV
1999
IEEE
14 years 1 months ago
1999
IEEE
We show that the set of all ow- elds in a sequence of frames imaging a rigid scene resides in a lowdimensional linear subspace. Based on this observation, we develop a method for ...
EUROCRYPT
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. We consider the problem of sending messages into the future." Previous constructions for this task were either based on heuristic assumptions or did not provide anon...