Sciweavers

1172 search results - page 133 / 235
» Path Algorithms on Regular Graphs
Sort
View
101
Voted
CORR
2010
Springer
112views Education» more  CORR 2010»
15 years 21 days ago
On Finding Frequent Patterns in Event Sequences
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
Andrea Campagna, Rasmus Pagh
WEA
2010
Springer
281views Algorithms» more  WEA 2010»
15 years 5 months ago
Distributed Time-Dependent Contraction Hierarchies
Server based route planning in road networks is now powerful enough to find quickest paths in a matter of milliseconds, even if detailed information on time-dependent travel times...
Tim Kieritz, Dennis Luxen, Peter Sanders, Christia...
109
Voted
MICCAI
2008
Springer
16 years 1 months ago
Automatic Image Analysis of Histopathology Specimens Using Concave Vertex Graph
Automatic image analysis of histopathology specimens would help the early detection of blood cancer. The first step for automatic image analysis is segmentation. However, touching ...
Lin Yang, Oncel Tuzel, Peter Meer, David J. For...
LATIN
2010
Springer
14 years 11 months ago
Packet Routing on the Grid
The packet routing problem, i.e., the problem to send a given set of unit-size packets through a network on time, belongs to one of the most fundamental routing problems with impor...
Britta Peis, Martin Skutella, Andreas Wiese
ICCAD
2008
IEEE
140views Hardware» more  ICCAD 2008»
15 years 9 months ago
Algorithms for simultaneous consideration of multiple physical synthesis transforms for timing closure
We propose a post-placement physical synthesis algorithm that can apply multiple circuit synthesis and placement transforms on a placed circuit to improve the critical path delay ...
Huan Ren, Shantanu Dutt