773 search results - page 92 / 155 » Traversing the Machining Graph |
179
click to vote
ASUNAM
2011
IEEE
13 years 9 months ago
2011
IEEE
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
100
click to vote
MICCAI
2010
Springer
14 years 8 months ago
2010
Springer
Segmentation is a fundamental problem in medical image analysis. The use of prior knowledge is often considered to address the ill-posedness of the process. Such a process consists...
105
click to vote
CPM
1994
Springer
15 years 1 months ago
1994
Springer
Recently, a new compact representation for suboptimal alignments was proposed by Naor and Brutlag (1993). The kernel of that representation is a minimal directed acyclic graph (DAG...
RTA
2010
Springer
15 years 1 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
SIGIR
2008
ACM
14 years 9 months ago
2008
ACM
Collections are a fundamental tool for reproducible evaluation of information retrieval techniques. We describe a new method for distributing the document lengths and term counts ...