Sciweavers

1593 search results - page 1 / 319
» The Complexity of Computing the Size of an Interval
Sort
View
ICALP
2001
Springer
13 years 9 months ago
The Complexity of Computing the Size of an Interval
Lane A. Hemaspaandra, Sven Kosub, Klaus W. Wagner
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
13 years 10 months ago
Simultaneous budget and buffer size computation for throughput-constrained task graphs
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
Maarten Wiggers, Marco Bekooij, Marc Geilen, Twan ...
TCS
2010
12 years 11 months ago
On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
Mauro Mezzini
HAID
2010
Springer
13 years 3 months ago
The Influence of Angle Size in Navigation Applications Using Pointing Gestures
One factor which can be expected to influence performance in applications where the user points a device in some direction to obtain information is the angle interval in which the ...
Charlotte Magnusson, Kirsten Rassmus-Gröhn, D...
CCA
2009
Springer
13 years 9 months ago
From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interv
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
Vladik Kreinovich