Sciweavers

604 search results - page 103 / 121
» On the Complexity of the Maximum Cut Problem
Sort
View
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
14 years 1 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 ...
3DIM
1997
IEEE
14 years 29 days ago
Multi-Resolution Geometric Fusion
Geometric fusion of multiple sets of overlapping surface measurements is an important problem for complete 3D object or environment modelling. Fusion based on a discrete implicit ...
Adrian Hilton, John Illingworth
PODC
2010
ACM
14 years 19 days ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela
EUROPAR
2004
Springer
14 years 14 days ago
Imprecise Exceptions in Distributed Parallel Components
Abstract. Modern microprocessors have sacrificed the exactness of exceptions for improved performance long ago. This is a side effect of reordering instructions so that the micropr...
Kostadin Damevski, Steven G. Parker
KDD
2000
ACM
115views Data Mining» more  KDD 2000»
14 years 9 days ago
Mining asynchronous periodic patterns in time series data
Periodicy detection in time series data is a challenging problem of great importance in many applications. Most previous work focused on mining synchronous periodic patterns and d...
Jiong Yang, Wei Wang 0010, Philip S. Yu