1220 search results - page 62 / 244 » Minimal Interval Completions |
DATE
2009
IEEE
14 years 4 months ago
2009
IEEE
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
ICASSP
2008
IEEE
14 years 3 months ago
2008
IEEE
This paper derives the Cramer-Rao lower bound (CRLB) on estimates of the frequency of a coherent pulse-train passively intercepted at a moving antenna. Such estimates are used to ...
ICDM
2006
IEEE
14 years 3 months ago
2006
IEEE
The problem of discovering arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence, is studied, and two efficient approaches are propose...
COMBINATORICA
2008
13 years 9 months ago
2008
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...
FCSC
2011
13 years 24 days ago
2011
Description logics (DLs) are widely employed in recent semantic web application systems. However, classical description logics are limited when dealing with imprecise concepts and ...