Sciweavers

2645 search results - page 176 / 529
» time 2003
Sort
View
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 6 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
CCGRID
2003
IEEE
15 years 11 months ago
A Performance Oriented Migration Framework For The Grid
At least three factors in the existing migrating systems make them less suitable in Grid systems especially when the goal is to improve the response times for individual applicati...
Sathish S. Vadhiyar, Jack Dongarra
CSFW
2003
IEEE
15 years 11 months ago
Probabilistic Noninterference through Weak Probabilistic Bisimulation
To be practical, systems for ensuring secure information flow must be as permissive as possible. To this end, the author recently proposed a type system for multi-threaded progra...
Geoffrey Smith
ICDAR
2003
IEEE
15 years 11 months ago
Accelerating Large Character Set Recognition using Pivots
This paper proposes a method to accelerate character recognition of a large character set by employing pivots into the search space. We divide the feature space of character categ...
Yiping Yang, Ondrej Velek, Masaki Nakagawa
SPAA
2003
ACM
15 years 11 months ago
Online oblivious routing
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Mey...