Sciweavers

2080 search results - page 407 / 416
» Measuring empirical computational complexity
Sort
View
HICSS
2002
IEEE
113views Biometrics» more  HICSS 2002»
15 years 6 months ago
Designing and Examining PC to Palm Collaboration
One trend in day-to-day computing involves moving seamlessly from large powerful workstations to small handheld devices. A second trend is continuous collaboration with colleagues...
Ivan Marsic, Allan Meng Krebs, Bogdan Dorohonceanu...
VLDB
2001
ACM
190views Database» more  VLDB 2001»
15 years 6 months ago
LEO - DB2's LEarning Optimizer
Most modern DBMS optimizers rely upon a cost model to choose the best query execution plan (QEP) for any given query. Cost estimates are heavily dependent upon the optimizer’s e...
Michael Stillger, Guy M. Lohman, Volker Markl, Mok...
ISAAC
1998
Springer
99views Algorithms» more  ISAAC 1998»
15 years 6 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...
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 6 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
STOC
2010
ACM
269views Algorithms» more  STOC 2010»
15 years 6 months ago
Approximations for the Isoperimetric and Spectral Profile of Graphs and Related Parameters
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
Prasad Raghavendra, David Steurer and Prasad Tetal...