659 search results - page 63 / 132 » Dynamic Algorithms for Graph Spanners |
WEA
2005
Springer
14 years 1 months ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
ISWC
2003
IEEE
14 years 28 days ago
2003
IEEE
Context-aware computing describes the situation where a wearable / mobile computer is aware of its user’s state and surroundings and modifies its behavior based on this informat...
ECML
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We present a new reinforcement learning approach for deterministic continuous control problems in environments with unknown, arbitrary reward functions. The difficulty of...
COMGEO
2012
ACM
12 years 3 months ago
2012
ACM
A straight-line drawing of a plane graph G is a planar drawing of G, where each vertex is drawn as a point and each edge is drawn as a straight line segment. Given a set S of n poi...
ICIP
2000
IEEE
14 years 8 months ago
2000
IEEE
We present an algorithm that extracts the largest shape within a specificclass, starting from a set of image edgels. The algorithm inherits the Best-First Segmentation approach [jp...