Sciweavers

605 search results - page 40 / 121
» Geometrical Structure of Boosting Algorithm
Sort
View
ICPR
2004
IEEE
14 years 8 months ago
Shape Retrieval using Concavity Trees
y trees are well-known abstract structures. This paper proposes a new shape-based image retrieval method based on concavity trees. The proposed method has two main components. The...
Mohamed Kamel, Ossama El Badawy
AAAI
2011
12 years 7 months ago
CCRank: Parallel Learning to Rank with Cooperative Coevolution
We propose CCRank, the first parallel algorithm for learning to rank, targeting simultaneous improvement in learning accuracy and efficiency. CCRank is based on cooperative coev...
Shuaiqiang Wang, Byron J. Gao, Ke Wang, Hady Wiraw...
SGP
2004
13 years 10 months ago
Two Algorithms for Fast Reclustering of Dynamic Meshed Surfaces
Numerous mesh algorithms such as parametrization, radiosity, and collision detection require the decomposition of meshes into a series of clusters. In this paper we present two no...
Nathan A. Carr, John C. Hart
COMPGEOM
2009
ACM
14 years 2 months ago
Computing hereditary convex structures
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
Bernard Chazelle, Wolfgang Mulzer
TSP
2008
143views more  TSP 2008»
13 years 7 months ago
Sparse Representation in Structured Dictionaries With Application to Synthetic Aperture Radar
Sparse signal representations and approximations from overcomplete dictionaries have become an invaluable tool recently. In this paper, we develop a new, heuristic, graph-structure...
Kush R. Varshney, Müjdat Çetin, John W...