Sciweavers

16 search results - page 3 / 4
» Generating connected acyclic digraphs uniformly at random
Sort
View
DAC
2003
ACM
14 years 7 months ago
The synthesis of cyclic combinational circuits
Combinational circuits are generally thought of as acyclic structures. It is known that cyclic structures can be combinational, and techniques have been proposed to analyze cyclic...
Marc D. Riedel, Jehoshua Bruck
ICC
2007
IEEE
137views Communications» more  ICC 2007»
14 years 17 days ago
On the Simulation of Tikhonov Random Processes
Abstract— A novel, simple and efficient method for the generation of Tikhonov (a.k.a. von Mises) random variates is proposed. In the proposed method, circular variates of a pres...
Giuseppe Thadeu Freitas de Abreu
ITA
2006
13 years 6 months ago
Probabilistic models for pattern statistics
In this work we study some probabilistic models for the random generation of words over a given alphabet used in the literature in connection with pattern statistics. Our goal is t...
Massimiliano Goldwurm, Roberto Radicioni
INFOCOM
2000
IEEE
13 years 10 months ago
Virtual Backbone Generation and Maintenance in Ad Hoc Network Mobility Management
Abstract—In this paper, we present the implementation issues of a virtual backbone that supports the operations of the Uniform Quorum System (UQS) and the Randomized Database Gro...
Ben Liang, Zygmunt J. Haas
INFOCOM
2007
IEEE
14 years 16 days ago
Oblivious Routing with Mobile Fusion Centers over a Sensor Network
— We consider the problem of aggregating data at a mobile fusion center (fusor) (eg. a PDA or a cellular phone) moving within a spatial region over which a wireless sensor networ...
Devavrat Shah, Sanjay Shakkottai