Sciweavers

4934 search results - page 245 / 987
» complexity 2008
Sort
View
175
Voted
SIAMCOMP
2002
153views more  SIAMCOMP 2002»
15 years 5 months ago
A Decision Procedure for Unitary Linear Quantum Cellular Automata
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quan...
Christoph Dürr, Miklos Santha
136
Voted
TOSEM
2002
93views more  TOSEM 2002»
15 years 5 months ago
Alloy: a lightweight object modelling notation
Alloy is a little language for describing structural properties. It offers a declaration syntax compatible with graphical object models, and a set-based formula syntax powerful en...
Daniel Jackson
169
Voted
WINET
2002
103views more  WINET 2002»
15 years 5 months ago
LeZi-Update: An Information-Theoretic Framework for Personal Mobility Tracking in PCS Networks
The complexity of the mobility tracking problem in a cellular environment has been characterized under an information-theoretic framework. Shannon's entropy measure is identif...
Amiya Bhattacharya, Sajal K. Das
PVLDB
2010
189views more  PVLDB 2010»
15 years 4 months ago
Slicing Long-Running Queries
The ability to decompose a complex, long-running query into simpler queries that produce the same result is useful for many scenarios, such as admission control, resource manageme...
Nicolas Bruno, Vivek R. Narasayya, Ravishankar Ram...
132
Voted
SIGACT
2010
74views more  SIGACT 2010»
15 years 4 months ago
Typically-correct derandomization
A fundamental question in complexity theory is whether every randomized polynomial time algorithm can be simulated by a deterministic polynomial time algorithm (that is, whether B...
Ronen Shaltiel