Sciweavers

316 search results - page 59 / 64
» On Approximate Majority and Probabilistic Time
Sort
View
SIGMETRICS
2008
ACM
115views Hardware» more  SIGMETRICS 2008»
13 years 8 months ago
Densification arising from sampling fixed graphs
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...
Pedram Pedarsani, Daniel R. Figueiredo, Matthias G...
TCS
2011
13 years 3 months ago
On the relationship between fuzzy and Boolean cellular automata
Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification" of the local rule of a corresponding Boolean cellula...
Heather Betel, Paola Flocchini
DAC
2001
ACM
14 years 9 months ago
Latency-Driven Design of Multi-Purpose Systems-On-Chip
Milenko Drinic UCLA Computer Science Dep. 4732 Boelter Hall Los Angeles, CA 90095-1596 milenko@cs.ucla.edu Darko Kirovski Microsoft Research One Microsoft Way Redmond, WA 98052 da...
Seapahn Meguerdichian, Milenko Drinic, Darko Kirov...
ICDE
2009
IEEE
174views Database» more  ICDE 2009»
14 years 3 months ago
Sketching Sampled Data Streams
—Sampling is used as a universal method to reduce the running time of computations – the computation is performed on a much smaller sample and then the result is scaled to comp...
Florin Rusu, Alin Dobra
GLOBECOM
2009
IEEE
14 years 3 months ago
Emulation of Optical PIFO Buffers
—With recent advances in optical technology, we are closer to building all-optical routers than ever before. A major problem in this area, however, is the lack of all-optical mem...
Houman Rastegarfar, Monia Ghobadi, Yashar Ganjali