2200 search results - page 199 / 440 » Bloch's Constant is Computable |
159
click to vote
FORMATS
2003
Springer
15 years 11 months ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
168
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
This paper approaches the incremental view maintenance problem from an algebraic perspective. We construct a ring of databases and use it as the foundation of the design of a quer...
185
click to vote
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract—Cache pre-filling is emerging as a new concept for increasing the availability of popular web items in cache servers. According to this concept, web items are sent by a...
171
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
182
click to vote
CCECE
2009
IEEE
15 years 11 months ago
2009
IEEE
—This paper presents a capacity analysis of a decode-and-forward (DF) cooperative network with adaptive source transmission. Three different adaptive techniques are considered: (...