457 search results - page 6 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
DCC
2008
IEEE
14 years 1 months ago
2008
IEEE
We consider symmetric multiple description coding for the Gaussian source, and provide upper and lower bounds for the individual description rate-distortion function. One of the m...
FOSSACS
2007
Springer
14 years 1 months ago
2007
Springer
A web service is modeled here as a finite state machine. A composition problem for web services is to decide if a given web service can be constructed from a given set of web serv...
TCS
2002
13 years 7 months ago
2002
We investigate Martin's game (as described in Arruda et al. (Eds.), On Random R. E. Sets, Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
In this paper, we show that for every constant 0 < < 1/2 and for every constant d 2, the minimum size of a depth d Boolean circuit that -approximates Majority function on n ...
BMCBI
2007
13 years 7 months ago
2007
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...