Sciweavers

579 search results - page 33 / 116
» Intersecting Classes and Prototypes
Sort
View
AI
2008
Springer
13 years 7 months ago
Properties of tree convex constraints
It is known that a tree convex network is globally consistent if it is path consistent. However, if a tree convex network is not path consistent, enforcing path consistency on it ...
Yuanlin Zhang, Eugene C. Freuder
CORR
2008
Springer
104views Education» more  CORR 2008»
13 years 7 months ago
Coalgebraic Automata Theory: Basic Results
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...
Clemens Kupke, Yde Venema
DM
2010
89views more  DM 2010»
13 years 7 months ago
Polynomial-time dualization of r-exact hypergraphs with applications in geometry
Let H 2V be a hypergraph on vertex set V . For a positive integer r, we call H r-exact, if any minimal transversal of H intersects any hyperedge of H in at most r vertices. This ...
Khaled M. Elbassioni, Imran Rauf
DAM
2006
191views more  DAM 2006»
13 years 7 months ago
Approximating the minimum clique cover and other hard problems in subtree filament graphs
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
J. Mark Keil, Lorna Stewart
IJNSEC
2008
119views more  IJNSEC 2008»
13 years 7 months ago
Pass-Go: A Proposal to Improve the Usability of Graphical Passwords
Inspired by an old Chinese game, Go, we have designed a new graphical password scheme, Pass-Go, in which a user selects intersections on a grid as a way to input a password. While...
Hai Tao, Carlisle Adams