5115 search results - page 641 / 1023 » On Randomized Lanczos Algorithms |
159
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Given a set J of jobs, where each job j is associated with release date rj, deadline dj and processing time pj, our goal is to schedule all jobs using the minimum possibl...
192
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
We introduce the First Fit Matching Periods algorithm for rate-monotonic multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically...
161
click to vote
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
— We present an optimization-based approach to grasping and path planning for mobile manipulators. We focus on pick-and-place operations, where a given object must be moved from ...
211
click to vote
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— We propose a novel online framework for detecting moving shadows in video sequences using statistical learning techniques. In this framework, Support Vector Machines ar...
141
click to vote
SISAP
2008
IEEE
16 years 1 months ago
2008
IEEE
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...