457 search results - page 45 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
160
click to vote
FOCS
2008
IEEE
16 years 17 days ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
173
click to vote
SMA
2010
ACM
15 years 6 months ago
2010
ACM
Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball cent...
153
click to vote
RTCSA
1999
IEEE
15 years 10 months ago
1999
IEEE
In this paper; we describe optimal algorithmsfor incorporating error recovery in the imprecise computation model. In that model eack task compriser a mandatory and an optional par...
172
click to vote
ICDE
2010
IEEE
16 years 5 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...
145
click to vote
FOCS
1994
IEEE
15 years 10 months ago
1994
IEEE
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit r...