Sciweavers

4926 search results - page 555 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
SAC
2006
ACM
15 years 9 months ago
Grouping and aggregation in the concept-oriented data model
In the paper we describe the problem of grouping and aggregation in the concept-oriented data model. The model is based on ordering its elements within a hierarchical multidimensi...
Alexandr A. Savinov
ICASSP
2009
IEEE
15 years 10 months ago
Visual saliency with side information
We propose novel algorithms for organizing large image and video datasets using both the visual content and the associated sideinformation, such as time, location, authorship, and...
Wei Jiang, Lexing Xie, Shih-Fu Chang
ECCV
2008
Springer
16 years 5 months ago
A Generative Shape Regularization Model for Robust Face Alignment
In this paper, we present a robust face alignment system that is capable of dealing with exaggerating expressions, large occlusions, and a wide variety of image noises. The robustn...
Leon Gu, Takeo Kanade
125
Voted
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
15 years 4 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
ICONIP
2007
15 years 4 months ago
Using Generalization Error Bounds to Train the Set Covering Machine
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
Zakria Hussain, John Shawe-Taylor