Sciweavers

1356 search results - page 32 / 272
» Some New Results on Inverse Sorting Problems
Sort
View
RSS
2007
105views Robotics» more  RSS 2007»
13 years 9 months ago
Motion Strategies for Surveillance
Abstract— We address the problem of surveillance in an environment with obstacles. We show that the problem of tracking an evader with one pursuer around one corner is completely...
Sourabh Bhattacharya, Salvatore Candido, Seth Hutc...
SODA
2000
ACM
95views Algorithms» more  SODA 2000»
13 years 9 months ago
Towards a theory of cache-efficient algorithms
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
Sandeep Sen, Siddhartha Chatterjee
PARA
2004
Springer
14 years 27 days ago
Parallel Hybrid Sparse Solvers Through Flexible Incomplete Cholesky Preconditioning
Abstract. We consider parallel preconditioning schemes to accelerate the convergence of Conjugate Gradients (CG) for sparse linear system solution. We develop methods for construct...
Keita Teranishi, Padma Raghavan
IDA
2007
Springer
14 years 1 months ago
Learning to Align: A Statistical Approach
We present a new machine learning approach to the inverse parametric sequence alignment problem: given as training examples a set of correct pairwise global alignments, find the p...
Elisa Ricci, Tijl De Bie, Nello Cristianini
IPL
2006
84views more  IPL 2006»
13 years 7 months ago
Test suite oscillations
This paper proposes a set of new software test-diversity measures based on control oscillations of test suites. Oscillation Diversity uses conversion, inversion, and phase transfo...
Borislav Nikolik