Sciweavers

2168 search results - page 277 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
136
Voted
DIALM
2010
ACM
194views Algorithms» more  DIALM 2010»
15 years 1 months ago
Prioritized gossip in vehicular networks
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
Alejandro Cornejo, Calvin C. Newport
STOC
2002
ACM
99views Algorithms» more  STOC 2002»
16 years 3 months ago
Recognizing string graphs in NP
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
Marcus Schaefer, Eric Sedgwick, Daniel Stefankovic
ATAL
2008
Springer
15 years 5 months ago
Automated design of scoring rules by learning from examples
Scoring rules are a broad and concisely-representable class of voting rules which includes, for example, Plurality and Borda. Our main result asserts that the class of scoring rul...
Ariel D. Procaccia, Aviv Zohar, Jeffrey S. Rosensc...
91
Voted
ECCC
2007
69views more  ECCC 2007»
15 years 3 months ago
Testing Symmetric Properties of Distributions
We introduce the notion of a Canonical Tester for a class of properties on distributions, that is, a tester strong and general enough that “a distribution property in the class ...
Paul Valiant
ICDM
2008
IEEE
146views Data Mining» more  ICDM 2008»
15 years 10 months ago
Isolation Forest
Most existing model-based approaches to anomaly detection construct a profile of normal instances, then identify instances that do not conform to the normal profile as anomalies...
Fei Tony Liu, Kai Ming Ting, Zhi-Hua Zhou