Sciweavers

7289 search results - page 1278 / 1458
» A Dependent Set Theory
Sort
View
FAST
2008
13 years 10 months ago
Improving I/O Performance of Applications through Compiler-Directed Code Restructuring
Ever-increasing complexity of large-scale applications and continuous increases in sizes of the data they process make the problem of maximizing performance of such applications a...
Mahmut T. Kandemir, Seung Woo Son, Mustafa Karak&o...
CPM
2005
Springer
100views Combinatorics» more  CPM 2005»
13 years 10 months ago
Hardness of Optimal Spaced Seed Design
Abstract. Speeding up approximate pattern matching is a line of research in stringology since the 80’s. Practically fast approaches belong to the class of filtration algorithms,...
François Nicolas, Eric Rivals
CRV
2005
IEEE
342views Robotics» more  CRV 2005»
13 years 10 months ago
PDE-Based Robust Robotic Navigation
In robotic navigation, path planning is aimed at getting the optimum collision-free path between a starting and target locations. The optimality criterion depends on the surroundi...
M. Sabry Hassouna, Alaa E. Abdel-Hakim, Aly A. Far...
COMPGEOM
2008
ACM
13 years 10 months ago
Towards persistence-based reconstruction in euclidean spaces
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new method...
Frédéric Chazal, Steve Oudot
AAAI
2010
13 years 9 months ago
Asymmetric Spite in Auctions
In many auctions, agents bid more aggressively than selfinterest would prescribe. This can be explained by spite, where the agent's utility not only increases in the agent�...
Ankit Sharma, Tuomas Sandholm
« Prev « First page 1278 / 1458 Last » Next »