Sciweavers

1651 search results - page 299 / 331
» Measuring the Complexity of Classification Problems
Sort
View
SPAA
2010
ACM
14 years 15 days ago
Towards optimizing energy costs of algorithms for shared memory architectures
Energy consumption by computer systems has emerged as an important concern. However, the energy consumed in executing an algorithm cannot be inferred from its performance alone: i...
Vijay Anand Korthikanti, Gul Agha
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
13 years 11 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
CCGRID
2001
IEEE
13 years 11 months ago
Group Communication in Differentiated Services Networks
The Differentiated Services (DiffServ) approach will also bring benefits for multicast applications which need quality of service support. For instance, a highly reliable multicas...
Roland Bless, Klaus Wehrle
COMPGEOM
2005
ACM
13 years 9 months ago
Kinetic sorting and kinetic convex hulls
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
Mohammad Ali Abam, Mark de Berg
BMCBI
2008
97views more  BMCBI 2008»
13 years 7 months ago
Quantitative analysis of numerical solvers for oscillatory biomolecular system models
Background: This article provides guidelines for selecting optimal numerical solvers for biomolecular system models. Because various parameters of the same system could have drast...
Chang F. Quo, May D. Wang