493 search results - page 72 / 99 » Quantum Query Complexity of Some Graph Problems |
55
Voted
NAACL
2007
14 years 11 months ago
2007
We relate the problem of finding the best application of a Synchronous ContextFree Grammar (SCFG) rule during parsing to a Markov Random Field. This representation allows us to u...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
104
click to vote
WALCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
In a distributed computing environment a faulty node could lead other nodes in the system to behave in a faulty manor. An initial set of faults could make all the nodes in the syst...
73
Voted
EDBT
2006
ACM
15 years 9 months ago
2006
ACM
The problem of rewriting queries using views has received significant attention because of its applications in a wide variety of datamanagement problems. For select-project-join SQ...
91
Voted
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
This paper introduces the problem of modeling urban transportation systems in a database where certain aspects of the data are probabilistic in nature. The transportation network ...