Sciweavers

1855 search results - page 324 / 371
» Composing model programs for analysis
Sort
View
CORR
2007
Springer
110views Education» more  CORR 2007»
14 years 9 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
JACM
2006
98views more  JACM 2006»
14 years 9 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson
AIR
2005
99views more  AIR 2005»
14 years 9 months ago
Evolving General Term-Weighting Schemes for Information Retrieval: Tests on Larger Collections
Term-weighting schemes are vital to the performance of Information Retrieval models that use term frequency characteristics to determine the relevance of a document. The vector spa...
Ronan Cummins, Colm O'Riordan
ASPLOS
2010
ACM
15 years 4 months ago
Request behavior variations
A large number of user requests execute (often concurrently) within a server system. A single request may exhibit fluctuating hardware characteristics (such as instruction comple...
Kai Shen
FAW
2007
Springer
110views Algorithms» more  FAW 2007»
15 years 4 months ago
Maximizing the Number of Independent Labels in the Plane
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
Kuen-Lin Yu, Chung-Shou Liao, Der-Tsai Lee