Sciweavers

5302 search results - page 894 / 1061
» Learning How to Separate
Sort
View
TMM
2002
130views more  TMM 2002»
15 years 4 months ago
Computable scenes and structures in films
In this paper, we present a computational scene model and also derive novel algorithms for computing audio and visual scenes and within-scene structures in films. We use constraint...
Hari Sundaram, Shih-Fu Chang
137
Voted
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 4 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy
EC
2008
174views ECommerce» more  EC 2008»
15 years 4 months ago
Automated Design of Image Operators that Detect Interest Points
This work describes how evolutionary computation can be used to synthesize lowlevel image operators that detect interesting points on digital images. Interest point detection is a...
Leonardo Trujillo, Gustavo Olague
PRL
2007
148views more  PRL 2007»
15 years 4 months ago
Damascening video databases for evaluation of face tracking and recognition - The DXM2VTS database
Performance quantification of biometric systems, such as face tracking and recognition highly depend on the database used for testing the systems. Systems trained and tested on r...
Dereje Teferi, Josef Bigün
147
Voted
PRL
2007
108views more  PRL 2007»
15 years 4 months ago
Towards a measure of deformability of shape sequences
In this paper we develop a theory for characterizing how deformable a shape is given a sequence of its observations. We define a term called ‘‘deformability index’’ (DI) ...
Amit K. Roy Chowdhury