5595 search results - page 994 / 1119 » Approximation Algorithms for Clustering Problems |
158
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
This paper extends the Boltzmann Selection, a method in EDA with theoretical importance, from discrete domain to the continuous one. The difficulty of estimating the exact Boltzma...
154
Voted
ICPP
1995
IEEE
15 years 8 months ago
1995
IEEE
—We propose a unicasting algorithm for faulty hypercubes (including disconnected hypercubes) using the safety level concept. A faulty hypercube is a hypercube with faulty nodes a...
152
click to vote
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
Keyword search techniques that take advantage of XML structure make it very easy for ordinary users to query XML databases, but current approaches to processing these queries rely...
135
click to vote
SCA
2007
15 years 7 months ago
2007
We propose a method to automatically transform mesh animations into animation collages, i.e. moving assemblies of shape primitives from a database given by an artist. An animation...
185
click to vote
ASPDAC
2008
ACM
15 years 7 months ago
2008
ACM
In the nanometer manufacturing region, process variation causes significant uncertainty for circuit performance verification. Statistical static timing analysis (SSTA) is thus dev...