5595 search results - page 694 / 1119 » Approximation Algorithms for Clustering Problems |
182
click to vote
TIT
2008
15 years 6 months ago
2008
This paper is an enquiry into the interaction between multiple description coding (MDC) and network routing. We are mainly concerned with rate-distortion optimized network flow of...
180
click to vote
FCS
2006
15 years 8 months ago
2006
: In the complete graph K2m+3 for m 2, we study some structures of simple non-isomorphic Hamiltonian sub-graphs of the form H ( 2m+3 , 6m+3) for m 2 . The various structures of t...
201
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
178
click to vote
DAC
2010
ACM
15 years 8 months ago
2010
ACM
This work proposes a new problem of identifying large and tangled logic structures in a synthesized netlist. Large groups of cells that are highly interconnected to each other can...
189
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
Semi-Supervised Support Vector Machines (S3 VMs) are an appealing method for using unlabeled data in classification: their objective function favors decision boundaries which do n...