Sciweavers

3244 search results - page 165 / 649
» On convex complexity measures
Sort
View
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 5 months ago
On the Communication Complexity of Read-Once AC^0 Formulae
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
BMCBI
2007
124views more  BMCBI 2007»
15 years 2 months ago
A high-accuracy consensus map of yeast protein complexes reveals modular nature of gene essentiality
Background: Identifying all protein complexes in an organism is a major goal of systems biology. In the past 18 months, the results of two genome-scale tandem affinity purificatio...
G. Traver Hart, Insuk Lee, Edward M. Marcotte
100
Voted
ICPR
2008
IEEE
16 years 3 months ago
Bregman distance to L1 regularized logistic regression
In this work we investigate the relationship between Bregman distances and regularized Logistic Regression model. We present a detailed study of Bregman Distance minimization, a f...
Mithun Das Gupta, Thomas S. Huang
ICML
2008
IEEE
16 years 2 months ago
Fast nearest neighbor retrieval for bregman divergences
We present a data structure enabling efficient nearest neighbor (NN) retrieval for bregman divergences. The family of bregman divergences includes many popular dissimilarity measu...
Lawrence Cayton
SMI
2008
IEEE
150views Image Analysis» more  SMI 2008»
15 years 8 months ago
SHREC'08 entry: Multi-view 3D retrieval using multi-scale contour representation
We describe in this paper a method for 3D shape indexing and retrieval that we apply on three data collections of the SHREC SHape Retrieval Contest 2008: Stability on watertight, ...
Thibault Napoleon, Tomasz Adamek, Francis Schmitt,...