3267 search results - page 336 / 654 » Generalized quasirandom graphs |
175
click to vote
ICDT
2003
ACM
15 years 12 months ago
2003
ACM
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
193
click to vote
FSTTCS
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We propose a novel approach to clustering, based on deterministic analysis of random walks on the weighted graph associated with the clustering problem. The method is cen...
172
click to vote
ASPDAC
1998
ACM
15 years 11 months ago
1998
ACM
- In this paper, we study the wire sizing and wire spacing problem for post-layout performance optimization under Elmore delay model. Both ground capacitance and coupled capacitanc...
174
click to vote
CVPR
1997
IEEE
15 years 11 months ago
1997
IEEE
ÐWe propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach ...
151
click to vote
ICCAD
1993
IEEE
15 years 11 months ago
1993
IEEE
In this paper, we look at the problem of inverter minimization in multi-level logic networks. The network is specified in terms of a set of base functions and the inversion opera...