Sciweavers

688 search results - page 115 / 138
» General Partitioning on Random Graphs
Sort
View
CDC
2009
IEEE
115views Control Systems» more  CDC 2009»
15 years 5 months ago
Quantized consensus via adaptive stochastic gossip algorithm
Abstract— This paper is concerned with the distributed averaging problem over a given undirected graph. To enable every vertex to compute the average of the initial numbers sitti...
Javad Lavaei, Richard M. Murray
ICALP
2001
Springer
15 years 5 months ago
Approximation Algorithms for Partial Covering Problems
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
115
Voted
PVLDB
2010
127views more  PVLDB 2010»
14 years 7 months ago
Mining Significant Semantic Locations From GPS Data
With the increasing deployment and use of GPS-enabled devices, massive amounts of GPS data are becoming available. We propose a general framework for the mining of semantically me...
Xin Cao, Gao Cong, Christian S. Jensen
CAV
2011
Springer
216views Hardware» more  CAV 2011»
14 years 4 months ago
Malware Analysis with Tree Automata Inference
Abstract. The underground malware-based economy is flourishing and it is evident that the classical ad-hoc signature detection methods are becoming insufficient. Malware authors ...
Domagoj Babic, Daniel Reynaud, Dawn Song
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
15 years 5 months ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
Shimin Chen, Phillip B. Gibbons, Suman Nath