Sciweavers

2432 search results - page 69 / 487
» Degrees and choice numbers
Sort
View
CAAN
2007
Springer
16 years 10 days ago
Vertex Pursuit Games in Stochastic Network Models
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...
Anthony Bonato, Pawel Pralat, Changping Wang
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
15 years 6 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof
PODS
2005
ACM
131views Database» more  PODS 2005»
16 years 6 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan
WCNC
2010
IEEE
15 years 10 months ago
Node Connectivity Analysis in Multi-Hop Wireless Networks
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...
Bahador Bakhshi, Siavash Khorsandi
IJCAI
2007
15 years 7 months ago
On Mining Closed Sets in Multi-Relational Data
We investigate the problem of mining closed sets in multi-relational databases. Previous work introduced different semantics and associated algorithms for mining closed sets in mu...
Gemma C. Garriga, Roni Khardon, Luc De Raedt