Sciweavers

2638 search results - page 272 / 528
» Extracting Approximate Patterns
Sort
View
UIST
2009
ACM
16 years 1 months ago
Relaxed selection techniques for querying time-series graphs
Time-series graphs are often used to visualize phenomena that change over time. Common tasks include comparing values at different points in time and searching for specified patte...
Christian Holz, Steven Feiner
ICCS
2003
Springer
15 years 11 months ago
Exploiting Stability to Reduce Time-Space Cost for Memory Tracing
Memory traces record the addresses touched by a program during its execution, enabling many useful investigations for understanding and predicting program performance. But complete...
Xiaofeng Gao, Allan Snavely
CORR
2007
Springer
110views Education» more  CORR 2007»
15 years 6 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
IJBC
2007
90views more  IJBC 2007»
15 years 6 months ago
Extended Phase Diagram of the Lorenz Model
The parameter dependence of the various attractive solutions of the three variable nonlinear Lorenz model equations for thermal convection in Rayleigh-B´enard flow is studied. I...
H. R. Dullin, S. Schmidt, P. H. Richter, S. K. Gro...
WWW
2010
ACM
16 years 1 months ago
Empirical comparison of algorithms for network community detection
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney