Sciweavers

274 search results - page 48 / 55
» Program Compression
Sort
View
USENIX
1993
13 years 8 months ago
Essence: A Resource Discovery System Based on Semantic File Indexing
Discovering different types of file resources (such as documentation, programs, and images) in the vast amount of data contained within network file systems is useful for both u...
Darren R. Hardy, Michael F. Schwartz
CORR
2010
Springer
186views Education» more  CORR 2010»
13 years 7 months ago
Channel Estimation for Opportunistic Spectrum Access: Uniform and Random Sensing
The knowledge of channel statistics can be very helpful in making sound opportunistic spectrum access decisions. It is therefore desirable to be able to efficiently and accurately...
Quanquan Liang, Mingyan Liu
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 7 months ago
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
Martin J. Wainwright
COMPUTER
2000
138views more  COMPUTER 2000»
13 years 7 months ago
Making Pointer-Based Data Structures Cache Conscious
Processor and memory technology trends portend a continual increase in the relative cost of accessing main memory. Machine designers have tried to mitigate the effect of this tren...
Trishul M. Chilimbi, Mark D. Hill, James R. Larus
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 7 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg