2834 search results - page 73 / 567 » Representing Trees with Constraints |
151
click to vote
QOSIP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
175
click to vote
ESOP
1999
Springer
15 years 8 months ago
1999
Springer
This paper presents the rst approximation method of the nite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs wi...
140
click to vote
ICPADS
2008
IEEE
15 years 11 months ago
2008
IEEE
Existing solutions for top-k queries in wireless sensor networks mainly focused on energy efficiency and little attention has been paid to the response time to answer a top-k que...
150
click to vote
DAWAK
2007
Springer
15 years 8 months ago
2007
Springer
Most methods for temporal pattern mining assume that time is represented by points in a straight line starting at some initial instant. In this paper, we consider a new kind of fir...
114
click to vote
VL
1999
IEEE
15 years 8 months ago
1999
IEEE
Recently a new metaphor for diagramming, the intelligent diagram has emerged. This new metaphor provides an excellent basis for diagram beautification since it automatically colle...