Sciweavers

3937 search results - page 714 / 788
» Questioning Ubiquitous Computing
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
LICS
2009
IEEE
14 years 2 months ago
Expressiveness and Closure Properties for Quantitative Languages
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
CIKM
2009
Springer
14 years 2 months ago
On the feasibility of multi-site web search engines
Web search engines are often implemented as centralized systems. Designing and implementing a Web search engine in a distributed environment is a challenging engineering task that...
Ricardo A. Baeza-Yates, Aristides Gionis, Flavio J...
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
14 years 2 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
FSTTCS
2009
Springer
14 years 2 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud