Sciweavers

11381 search results - page 178 / 2277
» Connectivity
Sort
View
UIST
2004
ACM
15 years 9 months ago
Clip, connect, clone: combining application elements to build custom interfaces for information access
Many applications provide a form-like interface for requesting information: the user fills in some fields, submits the form, and the application presents corresponding results. ...
Jun Fujima, Aran Lunzer, Kasper Hornbæk, Yuz...
APPROX
2000
Springer
190views Algorithms» more  APPROX 2000»
15 years 8 months ago
Approximating node connectivity problems via set covers
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
Guy Kortsarz, Zeev Nutov
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
15 years 7 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
GIS
2008
ACM
15 years 5 months ago
Automatic extraction of road intersection position, connectivity, and orientations from raster maps
The road network is one of the most important types of information on raster maps. In particular, the set of road intersection templates, which consists of the road intersection p...
Yao-Yi Chiang, Craig A. Knoblock
AI
2010
Springer
15 years 4 months ago
Implementing logical connectives in constraint programming
Combining constraints using logical connectives such as disjunction is ubiquitous in constraint programming, because it adds considerable expressive power to a constraint language...
Christopher Jefferson, Neil C. A. Moore, Peter Nig...