Sciweavers

1511 search results - page 71 / 303
» Randomness, lowness and degrees
Sort
View
76
Voted
NOCS
2010
IEEE
14 years 10 months ago
A Low-Overhead Asynchronous Interconnection Network for GALS Chip Multiprocessors
A new asynchronous interconnection network is introduced for globally-asynchronous locally-synchronous (GALS) chip multiprocessors. The network eliminates the need for global cloc...
Michael N. Horak, Steven M. Nowick, Matthew Carlbe...
COMPSAC
2009
IEEE
15 years 3 months ago
Practical Extensions of a Randomized Testing Tool
—Many efficient random testing algorithms for object-oriented software have been proposed due to their simplicity and reasonable code coverage; however, even the stateof-the-art...
Hojun Jaygarl, Carl K. Chang, Sunghun Kim
ISSAC
2007
Springer
130views Mathematics» more  ISSAC 2007»
15 years 6 months ago
On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms
Algebraic randomization techniques can be applied to hybrid symbolic-numeric algorithms. Here we consider the problem of interpolating a sparse rational function from noisy values...
Erich Kaltofen, Zhengfeng Yang, Lihong Zhi
ICASSP
2011
IEEE
14 years 3 months ago
Random block-angular matrices for distributed data storage
Random binary matrices have found many applications in signal processing and coding. Rateless codes, for example, are based on the random generation of codewords by means of inner...
Paulo Jorge S. G. Ferreira, Bruno Jesus, Jose Viei...
ICDCS
2007
IEEE
15 years 6 months ago
Uniform Data Sampling from a Peer-to-Peer Network
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
Souptik Datta, Hillol Kargupta