8728 search results - page 222 / 1746 » On Reduct Construction Algorithms |
166
click to vote
LREC
2008
15 years 8 months ago
2008
A core ontology is a mid-level ontology which bridges the gap between an upper ontology and a domain ontology. Automatic Chinese core ontology construction can help quickly model ...
147
click to vote
WDAG
1995
Springer
15 years 10 months ago
1995
Springer
We present lock-free and wait-free universal constructions for implementing large shared objects. Most previous universal constructions require processes to copy the entire object...
204
click to vote
SPAA
1993
ACM
15 years 10 months ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
187
click to vote
ASPDAC
2006
ACM
16 years 17 days ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
175
click to vote
MMS
2006
15 years 6 months ago
2006
Vision systems are increasingly being deployed to perform complex surveillance tasks. While improved algorithms are being developed to perform these tasks, it is also important tha...