Sciweavers

258 search results - page 16 / 52
» Estimating the Distance to a Monotone Function
Sort
View
COCO
2001
Springer
135views Algorithms» more  COCO 2001»
13 years 12 months ago
Simple Analysis of Graph Tests for Linearity and PCP
We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan [16]. The analysis also applies to the linearity testing over finite field...
Johan Håstad, Avi Wigderson
HYBRID
2009
Springer
13 years 10 months ago
Distributed Wombling by Robotic Sensor Networks
This paper proposes a distributed coordination algorithm for robotic sensor networks to detect boundaries that separate areas of abrupt change of spatial phenomena. We consider an ...
Jorge Cortés
RSKT
2010
Springer
13 years 5 months ago
Naive Bayesian Rough Sets
A naive Bayesian classifier is a probabilistic classifier based on Bayesian decision theory with naive independence assumptions, which is often used for ranking or constructing a...
Yiyu Yao, Bing Zhou
MOR
2002
60views more  MOR 2002»
13 years 7 months ago
Properties of the Log-Barrier Function on Degenerate Nonlinear Programs
We examine the sequence of local minimizers of the log-barrier function for a nonlinear program near a solution at which second-order sufficient conditions and the Mangasarian-From...
Stephen J. Wright, Dominique Orban
ATAL
2010
Springer
13 years 8 months ago
On the role of distances in defining voting rules
A voting rule is an algorithm for determining the winner in an election, and there are several approaches that have been used to justify the proposed rules. One justification is t...
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko