Sciweavers

894 search results - page 38 / 179
» Universal Relations and
Sort
View
CVPR
2011
IEEE
13 years 4 months ago
Hyper-graph Matching via Reweighted Random Walks
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
Jungmin Lee (Seoul National University), Minsu Cho...
CATS
2006
13 years 9 months ago
On the Logical Implication of Multivalued Dependencies with Null Values
The implication of multivalued dependencies (MVDs) in relational databases has originally been defined in the context of some fixed finite universe (Fagin 1977, Zaniolo 1976). Whi...
Sebastian Link
PATAT
2000
Springer
89views Education» more  PATAT 2000»
13 years 11 months ago
A Language for Specifying Complete Timetabling Problems
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a given period of time, satisfying a set of different constraints. There are a nu...
Luís Paulo Reis, Eugenio Oliveira
CHI
2009
ACM
14 years 8 months ago
Enhancing input device evaluation: longitudinal approaches
Jens Gerken HCI Group, University of Konstanz Box D-73 78457 Konstanz, Germany jens.gerken@uni-konstanz.de Hans-Joachim Bieg HCI Group, University of Konstanz Box D-73 78457 Konsta...
Jens Gerken, Hans-Joachim Bieg, Stefan Dierdorf, H...
COLT
2004
Springer
14 years 1 months ago
Convergence of Discrete MDL for Sequential Prediction
We study the properties of the Minimum Description Length principle for sequence prediction, considering a two-part MDL estimator which is chosen from a countable class of models....
Jan Poland, Marcus Hutter