39 search results - page 7 / 8 » Plottable Real Number Functions and the Computable Graph The... |
CIKM
2010
Springer
13 years 4 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
CP
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...
CVPR
2009
IEEE
15 years 10 days ago
2009
IEEE
Density of moles is a strong predictor of malignant
melanoma. Some dermatologists advocate periodic fullbody
scan for high-risk patients. In current practice, physicians
compare...
RTCSA
2006
IEEE
14 years 1 days ago
2006
IEEE
ILP (Instruction Level Parallelism) processors are being increasingly used in embedded systems. In embedded systems, instructions may be subject to timing constraints. An optimisi...
ICDM
2006
IEEE
14 years 2 days ago
2006
IEEE
There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecu...