Sciweavers

1594 search results - page 189 / 319
» Visualizing Program Executions on Large Data Sets
Sort
View
214
Voted
GIS
2008
ACM
16 years 4 months ago
Parallel ODETLAP for terrain compression and reconstruction
We introduce a parallel approximation of an Over-determined Laplacian Partial Differential Equation solver (ODETLAP) applied to the compression and restoration of terrain data use...
Jared Stookey, Zhongyi Xie, Barbara Cutler, W. Ran...
BIOINFORMATICS
2006
106views more  BIOINFORMATICS 2006»
15 years 3 months ago
Identification of biochemical networks by S-tree based genetic programming
Motivation: Most previous approaches to model biochemical networks havefocusedeither on the characterization of a networkstructurewith a number of components or on the estimation ...
Dong-Yeon Cho, Kwang-Hyun Cho, Byoung-Tak Zhang
ESA
2001
Springer
75views Algorithms» more  ESA 2001»
15 years 8 months ago
Strongly Competitive Algorithms for Caching with Pipelined Prefetching
Suppose that a program makes a sequence of m accesses (references) to data blocks, the cache can hold k < m blocks, an access to a block in the cache incurs one time unit, and ...
Alexander Gaysinsky, Alon Itai, Hadas Shachnai
138
Voted
SIGSOFT
2008
ACM
16 years 4 months ago
Javert: fully automatic mining of general temporal properties from dynamic traces
Program specifications are important for many tasks during software design, development, and maintenance. Among these, temporal specifications are particularly useful. They expres...
Mark Gabel, Zhendong Su
ICML
2004
IEEE
15 years 9 months ago
Gradient LASSO for feature selection
LASSO (Least Absolute Shrinkage and Selection Operator) is a useful tool to achieve the shrinkage and variable selection simultaneously. Since LASSO uses the L1 penalty, the optim...
Yongdai Kim, Jinseog Kim