804 search results - page 116 / 161 » On the Termination of the Chase Algorithm |
122
click to vote
STOC
2010
ACM
15 years 5 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
120
click to vote
APNOMS
2006
Springer
15 years 4 months ago
2006
Springer
Peer-to-Peer systems are based on the concept of resources localization and mutualization in dynamic context. In specific environment such as mobile networks, characterized by high...
108
Voted
BMCBI
2010
15 years 24 days ago
2010
Emerging knowledge of whole prokaryotic transcriptomes could validate a number of theoretical concepts introduced in the early days of genomics. What are the rules connecting gene...
92
Voted
ICPR
2004
IEEE
16 years 1 months ago
2004
IEEE
In this paper, we propose a new prototype learning/matching method that can be combined with support vector machines (SVM) in pattern recognition. This hybrid method has the follo...
80
Voted
DAC
2006
ACM
16 years 1 months ago
2006
ACM
Steiner routing is a fundamental yet NP-hard problem in VLSI design and other research fields. In this paper, we propose to model the routing graph by an RC network with routing t...