222 search results - page 34 / 45 » Approximation Algorithms for the Job Interval Selection Prob... |
ICALP
2011
Springer
13 years 1 days ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
ADC
2003
Springer
14 years 1 months ago
2003
Springer
Selectivity estimation of queries not only provides useful information to the query processing optimization but also may give users a preview of processing results. In this paper,...
WADS
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
TNN
2010
13 years 3 months ago
2010
Abstract--Recently, sparse approximation has become a preferred method for learning large scale kernel machines. This technique attempts to represent the solution with only a subse...
IROS
2006
IEEE
14 years 2 months ago
2006
IEEE
—Many vision-based navigation systems are restricted to the use of only a limited number of landmarks when computing the camera pose. This limitation is due to the overhead of de...