Sciweavers

6251 search results - page 452 / 1251
» Randomness, Computability, and Density
Sort
View
WWW
2004
ACM
16 years 7 months ago
Efficient pagerank approximation via graph aggregation
We present a framework for approximating random-walk based probability distributions over Web pages using graph aggregation. We (1) partition the Web's graph into classes of ...
Andrei Z. Broder, Ronny Lempel, Farzin Maghoul, Ja...
VLSID
2002
IEEE
95views VLSI» more  VLSID 2002»
16 years 7 months ago
Design of an On-Chip Test Pattern Generator without Prohibited Pattern Set (PPS)
| This paper reports the design of a Test Pattern Generator (TPG) for VLSI circuits. The onchip TPG is so designed that it generates test patterns while avoiding generation of a gi...
Niloy Ganguly, Biplab K. Sikdar, Parimal Pal Chaud...
CISS
2008
IEEE
16 years 1 months ago
Distributed estimation in wireless sensor networks via variational message passing
Abstract – In this paper, a variational message passing framework is proposed for Markov random fields. Analogous to the traditional belief propagation algorithm, variational mes...
Yanbing Zhang, Huaiyu Dai
GECCO
2005
Springer
175views Optimization» more  GECCO 2005»
16 years 12 days ago
Meta-grammar constant creation with grammatical evolution by grammatical evolution
This study examines the utility of meta-grammar constant generation on a series of benchmark problems. The performance of the meta-grammar approach is compared to a grammar which ...
Ian Dempsey, Michael O'Neill, Anthony Brabazon
ICALP
2005
Springer
16 years 12 days ago
Quantum Complexity of Testing Group Commutativity
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
Frédéric Magniez, Ashwin Nayak