Sciweavers

2924 search results - page 379 / 585
» Lower Bounds in Distributed Computing
Sort
View
COCO
2005
Springer
128views Algorithms» more  COCO 2005»
15 years 10 months ago
More on Noncommutative Polynomial Identity Testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
Andrej Bogdanov, Hoeteck Wee
MFCS
2005
Springer
15 years 10 months ago
Nondeterministic Graph Searching: From Pathwidth to Treewidth
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse
MIR
2004
ACM
110views Multimedia» more  MIR 2004»
15 years 10 months ago
Symbolic representation and retrieval of moving object trajectories
Searching moving object trajectories of video databases has been applied to many fields, such as video data analysis, content-based video retrieval, video scene classification. ...
Lei Chen 0002, M. Tamer Özsu, Vincent Oria
FSTTCS
2004
Springer
15 years 10 months ago
Hardness Hypotheses, Derandomization, and Circuit Complexity
We consider hypotheses about nondeterministic computation that have been studied in different contexts and shown to have interesting consequences: • The measure hypothesis: NP d...
John M. Hitchcock, Aduri Pavan
ICALP
2004
Springer
15 years 10 months ago
Linear and Branching Metrics for Quantitative Transition Systems
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
Luca de Alfaro, Marco Faella, Mariëlle Stoeli...