Sciweavers

650 search results - page 88 / 130
» Part Analogies in Sets of Objects
Sort
View
SODA
2010
ACM
146views Algorithms» more  SODA 2010»
14 years 6 months ago
Classified Stable Matching
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
Chien-Chung Huang
ETVC
2008
13 years 10 months ago
Abstracts of the LIX Fall Colloquium 2008: Emerging Trends in Visual Computing
s of the LIX Fall Colloquium 2008: Emerging Trends in Visual Computing Frank Nielsen Ecole Polytechnique, Palaiseau, France Sony CSL, Tokyo, Japan Abstract. We list the abstracts o...
Frank Nielsen
SBBD
2004
119views Database» more  SBBD 2004»
13 years 10 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
ICCV
2005
IEEE
14 years 10 months ago
Appearance Modeling Under Geometric Context
We propose a unified framework based on a general definition of geometric transform (GeT) for modeling appearance. GeT represents the appearance by applying designed functionals o...
Jian Li, Shaohua Kevin Zhou, Rama Chellappa
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
14 years 9 months ago
BLOSOM: a framework for mining arbitrary boolean expressions
We introduce a novel framework (BLOSOM) for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: p...
Lizhuang Zhao, Mohammed J. Zaki, Naren Ramakrishna...