15485 search results - page 333 / 3097 » Computing Optimal Subsets |
122
click to vote
FOCS
2006
IEEE
16 years 23 days ago
2006
IEEE
We prove that the function d : R3 × R3 → [0, ∞) given by d (x, y, z), (t, u, v) = (t − x)2 + (u − y)2 2 + (v − z + 2xu − 2yt)2 1 2 + (t − x)2 + (u − y)2 1 2 . is ...
176
click to vote
SAC
2006
ACM
16 years 20 days ago
2006
ACM
We present a framework and an application for semanticbased retrieval of images. Our approach adopts a two-level ontology structure in a subset of OWL-DL. In the core ontology onl...
157
click to vote
GD
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. We introduce a new graph drawing convention for 3D hierarchical drawings of directed graphs. The vertex set is partitioned into layers of vertices drawn in parallel plane...
165
click to vote
DAC
2003
ACM
15 years 12 months ago
2003
ACM
Coverage estimation for model checking quantifies the completeness of a set of properties. We present an improved version of the algorithm of Hoskote et al. [7] that applies to a...
142
click to vote
DAC
1999
ACM
15 years 11 months ago
1999
ACM
IC inductance extraction generally produces either port inductances based on simplified current path assumptions or a complete partial inductance matrix. Combining either of thes...