Sciweavers

886 search results - page 71 / 178
» Learning Distance Functions using Equivalence Relations
Sort
View
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
15 years 10 months ago
Query evaluation using overlapping views: completeness and efficiency
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
Gang Gou, Maxim Kormilitsin, Rada Chirkova
COLT
2000
Springer
15 years 2 months ago
Entropy Numbers of Linear Function Classes
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
Robert C. Williamson, Alex J. Smola, Bernhard Sch&...
CTRSA
2011
Springer
223views Cryptology» more  CTRSA 2011»
14 years 1 months ago
Expedient Non-malleability Notions for Hash Functions
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
Paul Baecher, Marc Fischlin, Dominique Schröd...
ICPR
2008
IEEE
15 years 4 months ago
Online anomal movement detection based on unsupervised incremental learning
We propose an online anomal movement detection method using incremental unsupervised learning. As the feature for discrimination, we extract the principal component of the spatio-...
Kyoko Sudo, Tatsuya Osawa, Hidenori Tanaka, Hideki...
CSCLP
2008
Springer
14 years 11 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul