Sciweavers

1159 search results - page 78 / 232
» Binary Decision Graphs
Sort
View
ICANN
2009
Springer
14 years 2 months ago
Image Theft Detection with Self-Organising Maps
In this paper an application of the TS-SOM variant of the self-organising map algorithm on the problem of copyright theft detection for bitmap images is shown. The algorithm facili...
Philip Prentis, Mats Sjöberg, Markus Koskela,...
CORR
2000
Springer
100views Education» more  CORR 2000»
13 years 10 months ago
Algorithms for Analysing Firewall and Router Access Lists
Network firewalls and routers use a rule database to decide which packets will be allowed from one network onto another. By filtering packets the firewalls and routers can improve...
Scott Hazelhurst
SSPR
2004
Springer
14 years 3 months ago
An Optimal Probabilistic Graphical Model for Point Set Matching
We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relation...
Tibério S. Caetano, Terry Caelli, Dante Aug...
CPC
2006
110views more  CPC 2006»
13 years 10 months ago
Solving Sparse Random Instances of Max Cut and Max 2-CSP in Linear Expected Time
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
Alexander D. Scott, Gregory B. Sorkin
ICML
2007
IEEE
14 years 11 months ago
Constructing basis functions from directed graphs for value function approximation
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
Jeffrey Johns, Sridhar Mahadevan