Sciweavers

108 search results - page 14 / 22
» Revisiting Two Classical Results on Graph Spectra
Sort
View
128
Voted
SDM
2012
SIAM
340views Data Mining» more  SDM 2012»
13 years 2 months ago
IntruMine: Mining Intruders in Untrustworthy Data of Cyber-physical Systems
A Cyber-Physical System (CPS) integrates physical (i.e., sensor) devices with cyber (i.e., informational) components to form a situation-aware system that responds intelligently t...
Lu An Tang, Quanquan Gu, Xiao Yu, Jiawei Han, Thom...
SIAMDM
2010
128views more  SIAMDM 2010»
14 years 10 months ago
Permutation Capacities of Families of Oriented Infinite Paths
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
Graham Brightwell, Gérard D. Cohen, Emanuel...
WADS
2009
Springer
291views Algorithms» more  WADS 2009»
15 years 6 months ago
On the Power of the Semi-Separated Pair Decomposition
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Mic...
MOBICOM
2006
ACM
15 years 5 months ago
On the complexity of scheduling in wireless networks
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
Gaurav Sharma, Ravi R. Mazumdar, Ness B. Shroff
ALGORITHMICA
2007
93views more  ALGORITHMICA 2007»
14 years 12 months ago
Random 2-SAT with Prescribed Literal Degrees
Two classic “phase transitions” in discrete mathematics are the emergence of a giant component in a random graph as the density of edges increases, and the transition of a rand...
Colin Cooper, Alan M. Frieze, Gregory B. Sorkin