Sciweavers

3708 search results - page 208 / 742
» Approximating Betweenness Centrality
Sort
View
CORR
2010
Springer
162views Education» more  CORR 2010»
15 years 2 months ago
First steps in the logic-based assessment of post-composed phenotypic descriptions
In this paper we present a preliminary logic-based evaluation of the integration of post-composed phenotypic descriptions with domain ontologies. The evaluation has been performed ...
Ernesto Jiménez-Ruiz, Bernardo Cuenca Grau,...
SIAMJO
2010
125views more  SIAMJO 2010»
15 years 1 months ago
Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
We study the problem of minimizing the expected loss of a linear predictor while constraining its sparsity, i.e., bounding the number of features used by the predictor. While the r...
Shai Shalev-Shwartz, Nathan Srebro, Tong Zhang
COMPGEOM
2011
ACM
14 years 9 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
ICIP
2004
IEEE
16 years 7 months ago
Efficient face orientation discrimination
This paper presents efficient methods to address the problem of discriminating between five facial orientations. We present the most efficient methods for this task to date, which...
Shumeet Baluja, Mehran Sahami, Henry A. Rowley
165
Voted
ENDM
2008
80views more  ENDM 2008»
15 years 6 months ago
Polytopal complexes: maps, chain complexes and... necklaces
The notion of polytopal map between two polytopal complexes is defined. Surprisingly, this definition is quite simple and extends naturally those of simplicial and cubical maps. It...
Frédéric Meunier