307 search results - page 36 / 62 » Finite locally-quasiprimitive graphs |
154
click to vote
GLVLSI
1996
IEEE
15 years 6 months ago
1996
IEEE
Inthispaperweintroduceanondeterministiccounterpart to Reduced, Ordered Binary Decision Diagrams for the representation and manipulation of logic functions. ROBDDs are conceptually...
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
We present a method for transforming the infinite interactive state space of interactive POMDPs (I-POMDPs) into a finite one, thereby enabling the computation of exact solutions. ...
114
click to vote
ESANN
2004
15 years 3 months ago
2004
Standard pattern recognition provides effective and noise-tolerant tools for machine learning tasks; however, most approaches only deal with real vectors of a finite and fixed dime...
100
click to vote
CORR
2002
Springer
15 years 1 months ago
2002
Springer
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...
118
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...