Sciweavers

4908 search results - page 690 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
TON
2002
144views more  TON 2002»
15 years 6 months ago
Algorithms for provisioning virtual private networks in the hose model
Virtual Private Networks (VPNs) provide customers with predictable and secure network connections over a shared network. The recently proposed hose model for VPNs allows for great...
Amit Kumar, Rajeev Rastogi, Abraham Silberschatz, ...
ICCV
2009
IEEE
16 years 11 months ago
Multiple Kernels for Object Detection
Our objective is to obtain a state-of-the art object category detector by employing a state-of-the-art image classifier to search for the object in all possible image subwindows....
Andrea Vedaldi, Varun Gulshan, Manik Varma, Andrew...
ICCV
2007
IEEE
16 years 8 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
197
Voted
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
16 years 7 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 7 months ago
Exceeding expectations and clustering uncertain data
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
Sudipto Guha, Kamesh Munagala