Sciweavers

3422 search results - page 431 / 685
» Random Subset Optimization
Sort
View
ICPADS
2010
IEEE
15 years 1 months ago
Hybrid Checkpointing for MPI Jobs in HPC Environments
As the core count in high-performance computing systems keeps increasing, faults are becoming common place. Checkpointing addresses such faults but captures full process images ev...
Chao Wang, Frank Mueller, Christian Engelmann, Ste...
IEAAIE
2010
Springer
15 years 1 months ago
Constructive Neural Networks to Predict Breast Cancer Outcome by Using Gene Expression Profiles
Abstract. Gene expression profiling strategies have attracted considerable interest from biologist due to the potential for high throughput analysis of hundreds of thousands of gen...
Daniel Urda, José Luis Subirats, Leonardo F...
CDC
2010
IEEE
128views Control Systems» more  CDC 2010»
14 years 11 months ago
Greedy sensor selection: Leveraging submodularity
ACT We consider the problem of sensor selection in resource constrained sensor networks. The fusion center selects a subset of k sensors from an available pool of m sensors accordi...
Manohar Shamaiah, Siddhartha Banerjee, Haris Vikal...
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 10 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox
CORR
2011
Springer
197views Education» more  CORR 2011»
14 years 10 months ago
Query Expansion Based on Clustered Results
Query expansion is a functionality of search engines that suggests a set of related queries for a user-issued keyword query. Typical corpus-driven keyword query expansion approach...
Ziyang Liu, Sivaramakrishnan Natarajan, Yi Chen