1285 search results - page 126 / 257 » On the Complexity of Ordinal Clustering |
ICCAD
2001
IEEE
14 years 7 months ago
2001
IEEE
In this paper, we utilize Rent’s rule as an empirical measure for efficient clustering and placement of circuits on hierarchical FPGAs. We show that careful matching of design c...
ICRA
2009
IEEE
14 years 4 months ago
2009
IEEE
— In mobile robotics, the segmentation of range data is an important prerequisite to object recognition and environment understanding. This paper presents an algorithm for realti...
WAW
2009
Springer
14 years 4 months ago
2009
Springer
The Modularity-Q measure of community structure is known to falsely ascribe community structure to random graphs, at least when it is naively applied. Although Q is motivated by a ...
SRDS
2007
IEEE
14 years 4 months ago
2007
IEEE
Networked computing systems continue to grow in scale and in the complexity of their components and interactions. Component failures become norms instead of exceptions in these en...
PADS
2005
ACM
14 years 3 months ago
2005
ACM
— In this paper, a new event scheduling mechanism XEQ and a new rollback procedure rb-messages are proposed for use in optimistic logic simulation. We incorporate both of these t...