4066 search results - page 127 / 814 » Almost Complete Sets |
165
click to vote
ICDM
2008
IEEE
16 years 25 days ago
2008
IEEE
Many data sets are incomplete. For correct analysis of such data, one can either use algorithms that are designed to handle missing data or use imputation. Imputation has the bene...
185
click to vote
JGT
2008
15 years 6 months ago
2008
: Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. We say that F is a degree-sequence-forcing set if, for each graph G in ...
128
click to vote
DATE
2008
IEEE
16 years 26 days ago
2008
IEEE
This paper presents two fully polynomial-time sufficient feasibility tests for EDF when considering periodic tasks with arbitrary deadlines and preemptive scheduling on uniproces...
204
click to vote
ISPA
2007
Springer
16 years 16 days ago
2007
Springer
Regular path queries are the building block of almost any mechanism for querying semistructured data. Despite the fact that the main applications of such data are distributed, ther...
149
click to vote
KIVS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract: Although file and printer sharing services have been deployed almost ubiquitously for a long time as part of Microsoft Windows, only recent peer-to-peer applications pop...