Sciweavers

85 search results - page 13 / 17
» Partitioning and ordering large radiosity computations
Sort
View
CVPR
2006
IEEE
14 years 9 months ago
A Design Principle for Coarse-to-Fine Classification
Coarse-to-fine classification is an efficient way of organizing object recognition in order to accommodate a large number of possible hypotheses and to systematically exploit shar...
Sachin Gangaputra, Donald Geman
ICPR
2006
IEEE
14 years 8 months ago
Learning Pairwise Similarity for Data Clustering
Each clustering algorithm induces a similarity between given data points, according to the underlying clustering criteria. Given the large number of available clustering technique...
Ana L. N. Fred, Anil K. Jain
ICPR
2002
IEEE
14 years 8 months ago
Regularized Patch Motion Estimation
This paper presents a new formulation of the problem of motion estimation which attempts to give solutions to classical problems in the field, such as detection of motion disconti...
Ioannis Patras, Marcel Worring
DCC
2005
IEEE
14 years 7 months ago
The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments
A v-player whist tournament is a schedule of games, where in each round the v players are partitioned into games of four players each with at most one player left over. In each ga...
Harri Haanpää, Petteri Kaski
SIGMOD
2010
ACM
173views Database» more  SIGMOD 2010»
14 years 17 days ago
PR-join: a non-blocking join achieving higher early result rate with statistical guarantees
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
Shimin Chen, Phillip B. Gibbons, Suman Nath