1172 search results - page 145 / 235 » Path Algorithms on Regular Graphs |
112
Voted
FORMATS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...
129
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
Interactive image segmentation traditionally involves the
use of algorithms such as Graph Cuts or Random Walker.
Common concerns with using Graph Cuts are metrication
artifacts ...
153
Voted
WADS
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In this paper, we propose a new compact and low delay routing labeling scheme for Unit Disk Graphs (UDGs) which often model wireless ad hoc networks. We show that one can...
137
Voted
LATIN
2010
Springer
15 years 9 months ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...
112
Voted
KDD
2009
ACM
16 years 3 months ago
2009
ACM
Most of recommender systems try to find items that are most relevant to the older choices of a given user. Here we focus on the "surprise me" query: A user may be bored ...