Sciweavers

2899 search results - page 14 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
PODS
2004
ACM
109views Database» more  PODS 2004»
16 years 1 months ago
On the Complexity of Optimal K-Anonymity
The technique of k-anonymization has been proposed in the literature as an alternative way to release public information, while ensuring both data privacy and data integrity. We p...
Adam Meyerson, Ryan Williams
ICIP
1998
IEEE
16 years 2 months ago
Reducing the Computational Complexity of a Map Post-Processing Algorithm for Video Sequences
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
Mark A. Robertson, Robert L. Stevenson
ICDE
1996
IEEE
124views Database» more  ICDE 1996»
16 years 2 months ago
Automating the Assembly of Presentations from Multimedia Databases
A multimedia presentation refers to the presentation of multimedia data using output devices such as monitors for text and video, and speakers for audio. Each presentation consist...
Gultekin Özsoyoglu, Joel Kraft, Veli Hakkoyma...
WAIM
2010
Springer
14 years 11 months ago
Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs
SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investi...
Weiren Yu, Xuemin Lin, Jiajin Le
4OR
2008
56views more  4OR 2008»
15 years 1 months ago
Exact and approximate resolution of integral multiflow and multicut problems: algorithms and complexity
This is a summary of the author's PhD thesis supervised by Marie-Christine Costa and Fr
Cédric Bentz