848 search results - page 120 / 170 » Randomness and the linear degrees of computability |
114
click to vote
CLUSTER
2002
IEEE
14 years 11 months ago
2002
IEEE
Abstract. We describe and evaluate the Running Time Advisor (RTA), a system that can predict the running time of a compute-bound task on a typical shared, unreserved commodity host...
116
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
Eigenvectors of data matrices play an important role in many computational problems, ranging from signal processing to machine learning and control. For instance, algorithms that ...
104
click to vote
IPMI
2007
Springer
16 years 20 days ago
2007
Springer
Volumetric registration of brains is required for inter-subject studies of functional and anatomical data. Intensity-driven registration typically results in some degree of misalig...
ICCAD
2003
IEEE
15 years 8 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
IROS
2006
IEEE
15 years 5 months ago
2006
IEEE
Abstract— We study the problem of registering local relative pose estimates to produce a global consistent trajectory of a moving robot. Traditionally, this problem has been stud...