Sciweavers

548 search results - page 22 / 110
» Global value numbering using random interpretation
Sort
View
TIT
2008
121views more  TIT 2008»
14 years 9 months ago
Stability Results for Random Sampling of Sparse Trigonometric Polynomials
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
Holger Rauhut
TIT
2008
87views more  TIT 2008»
14 years 9 months ago
On Correcting Bursts (and Random Errors) in Vector Symbol (n, k) Cyclic Codes
Simple methods are shown for correcting bursts of large size and bursts combined with random errors using vector symbols and primarily vector XOR and feedback shift register operat...
John J. Metzner
BMCBI
2007
127views more  BMCBI 2007»
14 years 10 months ago
Characterization of protein-interaction networks in tumors
Background: Analyzing differential-gene-expression data in the context of protein-interaction networks (PINs) yields information on the functional cellular status. PINs can be for...
Alexander Platzer, Paul Perco, Arno Lukas, Bernd M...
UAI
2000
14 years 11 months ago
Utilities as Random Variables: Density Estimation and Structure Discovery
Decision theory does not traditionally include uncertainty over utility functions. We argue that the a person's utility value for a given outcome can be treated as we treat o...
Urszula Chajewska, Daphne Koller
CPC
1998
154views more  CPC 1998»
14 years 9 months ago
Asymptotic Enumeration of Eulerian Circuits in the Complete Graph
We determine the asymptotic behaviour of the number of eulerian circuits in a complete graph of odd order. One corollary of our result is the following. If a maximum random walk, ...
Brendan D. McKay, Robert W. Robinson