Sciweavers

256 search results - page 19 / 52
» A New Synchronous Lower Bound for Set Agreement
Sort
View
WOWMOM
2006
ACM
122views Multimedia» more  WOWMOM 2006»
16 years 3 days ago
Multiple-Access Insights from Bounds on Sensor Localization
In this paper, we build on known bounds on localization in sensor networks and provide new insights that can be used in multiple-access design from a localization perspective. Spe...
Swaroop Venkatesh, R. Michael Buehrer
PAKDD
2009
ACM
149views Data Mining» more  PAKDD 2009»
15 years 10 months ago
A New Local Distance-Based Outlier Detection Approach for Scattered Real-World Data
Detecting outliers which are grossly different from or inconsistent with the remaining dataset is a major challenge in real-world KDD applications. Existing outlier detection met...
Ke Zhang, Marcus Hutter, Huidong Jin
SAT
2007
Springer
121views Hardware» more  SAT 2007»
16 years 8 days ago
MiniMaxSat: A New Weighted Max-SAT Solver
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that incorporates the best SAT and Max-SAT techniques. It can handle hard clauses (clauses of mandatory satisfaction as ...
Federico Heras, Javier Larrosa, Albert Oliveras
COMPGEOM
2000
ACM
15 years 10 months ago
A trace bound for the hereditary discrepancy
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
Bernard Chazelle, Alexey Lvov
FOCS
2009
IEEE
16 years 27 days ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu