Sciweavers

672 search results - page 126 / 135
» Lower-stretch spanning trees
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
Region Classification with Markov Field Aspect Models
Considerable advances have been made in learning to recognize and localize visual object classes. Simple bag-offeature approaches label each pixel or patch independently. More adv...
Jakob J. Verbeek, Bill Triggs
ICDE
2003
IEEE
138views Database» more  ICDE 2003»
14 years 8 months ago
Using State Modules for Adaptive Query Processing
We present a query architecture in which join operators are decomposed into their constituent data structures (State Modules, or SteMs), and dataflow among these SteMs is managed ...
Vijayshankar Raman, Amol Deshpande, Joseph M. Hell...
STOC
2007
ACM
112views Algorithms» more  STOC 2007»
14 years 7 months ago
Smooth sensitivity and sampling in private data analysis
We introduce a new, generic framework for private data analysis. The goal of private data analysis is to release aggregate information about a data set while protecting the privac...
Kobbi Nissim, Sofya Raskhodnikova, Adam Smith
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
14 years 7 months ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry
MOBIHOC
2007
ACM
14 years 7 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi