4524 search results - page 267 / 905 » The Complexity of Global Constraints |
178
click to vote
DATAMINE
2006
15 years 6 months ago
2006
Clustering methods for data-mining problems must be extremely scalable. In addition, several data mining applications demand that the clusters obtained be balanced, i.e., be of ap...
191
click to vote
TCAD
1998
15 years 6 months ago
1998
— We introduce a transformation, named rephasing, that manipulates the timing parameters in control-data-flow graphs (CDFG’s) during the high-level synthesis of data-pathinten...
175
click to vote
ACCV
1998
Springer
15 years 11 months ago
1998
Springer
Scale space is a natural way to handle multi-scale problems. Yang and Ma have considered the correspondence between scales, and proposed optical flow in the scale space. In this p...
160
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
We consider the problem of embedding arbitrary objects (e.g., images, audio, documents) into Euclidean space subject to a partial order over pairwise distances. Partial order cons...
159
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
We present an efficient method for maximizing energy functions with first and second order potentials, suitable for MAP labeling estimation problems that arise in undirected graph...