Sciweavers

882 search results - page 163 / 177
» Local Search for Very Large SAT Problems
Sort
View
MM
2006
ACM
155views Multimedia» more  MM 2006»
14 years 1 months ago
Robust voting algorithm based on labels of behavior for video copy detection
This paper presents an efficient approach for copies detection in a large videos archive consisting of several hundred of hours. The video content indexing method consists of ext...
Julien Law-To, Olivier Buisson, Valérie Gou...
ATAL
2003
Springer
14 years 19 days ago
An asynchronous complete method for distributed constraint optimization
We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-a...
Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Mak...
TPHOL
2009
IEEE
14 years 2 months ago
A Formalisation of Smallfoot in HOL
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
Thomas Tuerk
NIPS
2001
13 years 8 months ago
K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms
Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Neares...
Pascal Vincent, Yoshua Bengio
GRID
2007
Springer
13 years 7 months ago
Managing Role-Based Access Control Policies for Grid Databases in OGSA-DAI Using CAS
In this paper, we present a role-based access control method for accessing databases through the Open Grid Services Architecture – Data Access and Integration (OGSA-DAI) framewor...
Anil L. Pereira, Vineela Muppavarapu, Soon M. Chun...