Sciweavers

1554 search results - page 62 / 311
» Parameterized Complexity and Approximation Algorithms
Sort
View
113
Voted
COMPGEOM
2009
ACM
15 years 9 months ago
Approximate center points with proofs
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
Gary L. Miller, Donald Sheehy
129
Voted
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 2 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
142
Voted
CORR
2010
Springer
155views Education» more  CORR 2010»
14 years 9 months ago
A Complexity View of Markets with Social Influence
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...
Xi Chen, Shang-Hua Teng
107
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Approximate nearest-subspace representations for sound mixtures
In this paper we present a novel approach to describe sound mixtures which is based on a geometric viewpoint. In this approach we extend the idea of a nearest-neighbor representat...
Paris Smaragdis
SIGMOD
2002
ACM
198views Database» more  SIGMOD 2002»
16 years 2 months ago
Processing complex aggregate queries over data streams
Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) with only...
Alin Dobra, Minos N. Garofalakis, Johannes Gehrke,...