Sciweavers

217 search results - page 43 / 44
» A new upper bound on the cyclic chromatic number
Sort
View
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 3 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
TCC
2007
Springer
104views Cryptology» more  TCC 2007»
14 years 7 days ago
Unifying Classical and Quantum Key Distillation
Assume that two distant parties, Alice and Bob, as well as an adversary, Eve, have access to (quantum) systems prepared jointly according to a tripartite state ρABE. In addition, ...
Matthias Christandl, Artur Ekert, Michal Horodecki...
VLDB
2004
ACM
180views Database» more  VLDB 2004»
13 years 11 months ago
Bloom Histogram: Path Selectivity Estimation for XML Data with Updates
Cost-based XML query optimization calls for accurate estimation of the selectivity of path expressions. Some other interactive and internet applications can also benefit from suc...
Wei Wang 0011, Haifeng Jiang, Hongjun Lu, Jeffrey ...
ECRTS
2000
IEEE
13 years 10 months ago
Harmonious internal clock synchronization
Internal clock synchronization has been investigated, or employed, for quite a number of years, under the requirement of good upper bounds for the deviation, or accuracy, between ...
Horst F. Wedde, Wolfgang Freund
ISPD
1998
ACM
89views Hardware» more  ISPD 1998»
13 years 10 months ago
Filling and slotting: analysis and algorithms
In very deep-submicron VLSI, certain manufacturing steps – notably optical exposure, resist development and etch, chemical vapor deposition and chemical-mechanical polishing (CM...
Andrew B. Kahng, Gabriel Robins, Anish Singh, Huij...