4117 search results - page 272 / 824 » On the Satisfiability of Complex Constraints |
176
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...
189
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...
156
click to vote
ICIP
2006
IEEE
16 years 8 months ago
2006
IEEE
We introduce an optimum watermark embedding technique that satisfies common watermarking requirements such as visual fidelity, sufficient embedding rate, robustness against noise ...
266
click to vote
ICDE
2007
IEEE
16 years 8 months ago
2007
IEEE
k-Anonymity protects privacy by ensuring that data cannot be linked to a single individual. In a k-anonymous dataset, any identifying information occurs in at least k tuples. Much...
161
click to vote
ICPR
2002
IEEE
16 years 7 months ago
2002
IEEE
Multiview studies in Computer Vision have concentrated on the constraints satisfied by individual primitives such as points and lines. Not much attention has been paid to the prop...