1538 search results - page 243 / 308 » Spectral Techniques in Graph Algorithms |
141
click to vote
CCCG
2003
15 years 2 months ago
2003
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
108
click to vote
AAAI
1998
15 years 2 months ago
1998
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...
102
click to vote
COMSIS
2010
14 years 10 months ago
2010
The concept of complexity is used in many areas of computer science and software engineering. Software complexity metrics can be used to evaluate and compare quality of software de...
COLING
2010
14 years 8 months ago
2010
Fact collections are mostly built using semi-supervised relation extraction techniques and wisdom of the crowds methods, rendering them inherently noisy. In this paper, we propose...
104
click to vote
TGIS
2010
14 years 8 months ago
2010
The presented paper deals with a generic process for road network selection based on data enrichment and structure detection. The first step is to detect significant structures and...