Sciweavers

1715 search results - page 271 / 343
» How Space Structures Language
Sort
View
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
15 years 7 months ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
121
Voted
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
15 years 6 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
125
Voted
ENTCS
2002
152views more  ENTCS 2002»
15 years 2 months ago
Abstract Logics as Dialgebras
Logics as Dialgebras Alessandra Palmigiano Departament de L`ogica, Hist`oria i Filosofia de la Ci`encia, Universitat de Barcelona The aim of this report is to propose a line of re...
Alessandra Palmigiano
COMPUTER
1998
119views more  COMPUTER 1998»
15 years 2 months ago
Virtual Memory: Issues of Implementation
ion layer3,4 hides hardware particulars from the higher levels of software but can also compromise performance and compatibility; the higher levels of software often make unwitting...
Bruce L. Jacob, Trevor N. Mudge
144
Voted
SIGMOD
2012
ACM
203views Database» more  SIGMOD 2012»
13 years 5 months ago
Optimizing index for taxonomy keyword search
Query substitution is an important problem in information retrieval. Much work focuses on how to find substitutes for any given query. In this paper, we study how to efficiently ...
Bolin Ding, Haixun Wang, Ruoming Jin, Jiawei Han, ...