Sciweavers

605 search results - page 69 / 121
» Geometrical Structure of Boosting Algorithm
Sort
View
EMMCVPR
2011
Springer
12 years 9 months ago
Optimization of Robust Loss Functions for Weakly-Labeled Image Taxonomies: An ImageNet Case Study
The recently proposed ImageNet dataset consists of several million images, each annotated with a single object category. However, these annotations may be imperfect, in the sense t...
Julian John McAuley, Arnau Ramisa, Tibério ...
BMCBI
2007
114views more  BMCBI 2007»
13 years 9 months ago
Combination of scoring schemes for protein docking
Background: Docking algorithms are developed to predict in which orientation two proteins are likely to bind under natural conditions. The currently used methods usually consist o...
Philipp Heuser, Dietmar Schomburg
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
14 years 1 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
COMPGEOM
2006
ACM
14 years 3 months ago
Vines and vineyards by updating persistence in linear time
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy...
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 10 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup