3020 search results - page 111 / 604 » Optimal partition trees |
152
click to vote
SPAA
1996
ACM
15 years 10 months ago
1996
ACM
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
173
click to vote
SEMWEB
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In order to effectively and quickly answer queries in environments with distributed RDF/OWL, we present a query optimization algorithm to identify the potentially relevan...
169
click to vote
DFT
2008
IEEE
16 years 21 days ago
2008
IEEE
The paper presents a new technique for designing a concurrently checking combinational circuit. The technique is based on partitioning the circuit into two independent sub-circuit...
127
click to vote
ADCM
2005
15 years 6 months ago
2005
In this paper, we study a flexible piecewise approximation technique based on the use of the idea of the partition of unity. The approximations are piecewisely defined, globally sm...
173
click to vote
PAKDD
2001
ACM
15 years 10 months ago
2001
ACM
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...