Sciweavers

2168 search results - page 233 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
227
Voted
COMPGEOM
2005
ACM
15 years 9 months ago
Stability of persistence diagrams
The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the p...
David Cohen-Steiner, Herbert Edelsbrunner, John Ha...
176
Voted
COMPGEOM
2008
ACM
15 years 8 months ago
Reeb spaces of piecewise linear mappings
Generalizing the concept of a Reeb graph, the Reeb space of a multivariate continuous mapping identifies points of the domain that belong to a common component of the preimage of ...
Herbert Edelsbrunner, John Harer, Amit K. Patel
SODA
2001
ACM
92views Algorithms» more  SODA 2001»
15 years 8 months ago
On universally easy classes for NP-complete problems
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
Erik D. Demaine, Alejandro López-Ortiz, J. ...
ATAL
2007
Springer
16 years 1 months ago
Average-case tractability of manipulation in voting via the fraction of manipulators
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
Ariel D. Procaccia, Jeffrey S. Rosenschein
193
Voted
ATAL
2007
Springer
16 years 1 months ago
On the robustness of preference aggregation in noisy environments
In an election held in a noisy environment, agents may unintentionally perturb the outcome by communicating faulty preferences. We investigate this setting by introducing a theore...
Ariel D. Procaccia, Jeffrey S. Rosenschein, Gal A....