Sciweavers

13621 search results - page 2646 / 2725
» Computability and Complexity in Self-assembly
Sort
View
92
Voted
ISAAC
1998
Springer
99views Algorithms» more  ISAAC 1998»
15 years 5 months ago
On the Multiple Gene Duplication Problem
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...
Michael R. Fellows, Michael T. Hallett, Ulrike Ste...
121
Voted
VLDB
1998
ACM
180views Database» more  VLDB 1998»
15 years 5 months ago
Active Storage for Large-Scale Data Mining and Multimedia
The increasing performance and decreasing cost of processors and memory are causing system intelligence to move into peripherals from the CPU. Storage system designers are using t...
Erik Riedel, Garth A. Gibson, Christos Faloutsos
SIGMOD
1997
ACM
131views Database» more  SIGMOD 1997»
15 years 4 months ago
Maintenance of Data Cubes and Summary Tables in a Warehouse
Data warehouses contain large amounts of information, often collected from a variety of independent sources. Decision-support functions in a warehouse, such as on-line analytical ...
Inderpal Singh Mumick, Dallan Quass, Barinderpal S...
111
Voted
EURODAC
1994
IEEE
127views VHDL» more  EURODAC 1994»
15 years 4 months ago
Optimal equivalent circuits for interconnect delay calculations using moments
In performance-driven interconnect design, delay estimators are used to determine both the topology and the layout of good routing trees. We address the class of moment-matching, ...
Sudhakar Muddu, Andrew B. Kahng
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 4 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
« Prev « First page 2646 / 2725 Last » Next »