2283 search results - page 303 / 457 » Bounds of Graph Characteristics |
133
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Wigderson and Xiao presented an efficient derandomization of the matrix Chernoff bound using the method of pessimistic estimators [WX08]. Building on their construction, we prese...
150
Voted
TIT
2010
14 years 10 months ago
2010
We present a novel framework to estimate protein-protein (PPI) and domain-domain (DDI) interactions based on a belief propagation estimation method that efficiently computes inter...
138
Voted
TOG
2010
14 years 10 months ago
2010
Large corpora of 3D models, such as Google 3D Warehouse, are now becoming available on the web. It is possible to search these databases using a keyword search. This makes it poss...
145
Voted
CVPR
2011
IEEE
14 years 7 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
160
click to vote
TCC
2012
Springer
13 years 11 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...