Sciweavers

239 search results - page 28 / 48
» Hardness and algorithms for rainbow connection
Sort
View
EDBT
2012
ACM
291views Database» more  EDBT 2012»
13 years 2 months ago
Relevance search in heterogeneous networks
Conventional research on similarity search focuses on measuring the similarity between objects with the same type. However, in many real-world applications, we need to measure the...
Chuan Shi, Xiangnan Kong, Philip S. Yu, Sihong Xie...
IPPS
2009
IEEE
15 years 6 months ago
Unit disk graph and physical interference model: Putting pieces together
Modeling communications in wireless networks is a challenging task since it asks for a simple mathematical object on which efficient algorithms can be designed, but that must also...
Emmanuelle Lebhar, Zvi Lotker
GIS
2008
ACM
16 years 25 days ago
Feed-links for network extensions
Road network data is often incomplete, making it hard to perform network analysis. This paper discusses the problem of extending partial road networks with reasonable links, using...
Boris Aronov, Kevin Buchin, Maike Buchin, B. Janse...
AI
2003
Springer
15 years 5 months ago
Hybrid Randomised Neighbourhoods Improve Stochastic Local Search for DNA Code Design
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
Dan C. Tulpan, Holger H. Hoos
ECAI
2006
Springer
15 years 3 months ago
A Learning Classifier Approach to Tomography
Tomography is an important technique for noninvasive imaging: images of the interior of an object are computed from several scanned projections of the object, covering a range of a...
Kees Joost Batenburg