Sciweavers

10988 search results - page 2035 / 2198
» Algorithmic Folding Complexity
Sort
View
116
Voted
ISAAC
1998
Springer
99views Algorithms» more  ISAAC 1998»
15 years 7 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...
130
Voted
SIGMOD
1997
ACM
160views Database» more  SIGMOD 1997»
15 years 7 months ago
Improved Query Performance with Variant Indexes
: The read-mostly environment of data warehousing makes it possible to use more complex indexes to speed up queries than in situations where concurrent updatesare present. The curr...
Patrick E. O'Neil, Dallan Quass
DBPL
1997
Springer
90views Database» more  DBPL 1997»
15 years 7 months ago
Implementing Incremental View Maintenance in Nested Data Models
Previous research on materialized views has primarily been in the context of flat relational databases--materialized views defined in terms of one or more flat relations. This pape...
Akira Kawaguchi, Daniel F. Lieuwen, Inderpal Singh...
129
Voted
VISUALIZATION
1996
IEEE
15 years 7 months ago
Real-time Slicing of Data Space
This can be a costly operation. When the data is arranged according to its three-dimensional coordinates, calculating the contour surfaces requires examining each data cell. Avoidi...
Roger Crawfis
172
Voted
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 7 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 2035 / 2198 Last » Next »