Sciweavers

4797 search results - page 29 / 960
» The complexity of partition tasks
Sort
View
ICCV
2005
IEEE
14 years 10 months ago
Dynamic Measurement Clustering to Aid Real Time Tracking
Many parameter estimation problems admit divide and conquer or partitioning techniques in order to reduce a highdimensional task into several reduced-dimension problems. These tec...
Christopher Kemp, Tom Drummond
IPPS
2007
IEEE
14 years 3 months ago
Competitive Analysis of Partitioned Scheduling on Uniform Multiprocessors
Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can b...
Björn Andersson, Eduardo Tovar
SAC
2003
ACM
14 years 2 months ago
ARCHITECT-R: A System for Reconfigurable Robots Design
An increasing interest in the design of mobile robots has been observed in recent years, which is mainly motivated by technological advances that may allow their application to co...
R. A. Gonçalves, P. A. Moraes, João ...
ECRTS
2009
IEEE
13 years 6 months ago
Partitioned Fixed-Priority Preemptive Scheduling for Multi-core Processors
Abstract--Energy and thermal considerations are increasingly driving system designers to adopt multi-core processors. In this paper, we consider the problem of scheduling periodic ...
Karthik Lakshmanan, Ragunathan Rajkumar, John P. L...
CORR
2010
Springer
74views Education» more  CORR 2010»
13 years 9 months ago
Data Partitioning for Parallel Entity Matching
Entity matching is an important and difficult step for integrating web data. To reduce the typically high execution time for matching we investigate how we can perform entity matc...
Toralf Kirsten, Lars Kolb, Michael Hartung, Anika ...