Sciweavers

1857 search results - page 90 / 372
» Minimum Degree Orderings
Sort
View
PAIRING
2007
Springer
108views Cryptology» more  PAIRING 2007»
16 years 17 days ago
Constructing Pairing-Friendly Genus 2 Curves with Ordinary Jacobians
We provide the first explicit construction of genus 2 curves over finite fields whose Jacobians are ordinary, have large prime-order subgroups, and have small embedding degree. ...
David Freeman
ECSQARU
2007
Springer
16 years 18 days ago
An Algorithm for Computing Inconsistency Measurement by Paraconsistent Semantics
Measuring inconsistency in knowledge bases has been recognized as an important problem in many research areas. Most of approaches proposed for measuring inconsistency are based on ...
Yue Ma, Guilin Qi, Pascal Hitzler, Zuoquan Lin
FUIN
2010
158views more  FUIN 2010»
15 years 3 months ago
Cellular Automata, Decidability and Phasespace
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...
Klaus Sutner
IPL
2006
153views more  IPL 2006»
15 years 6 months ago
Oriented vertex and arc colorings of outerplanar graphs
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping from V (G) to V (H), that is (x)(y) is an arc in H whenever xy is an arc in G. The orie...
Alexandre Pinlou, Eric Sopena
CORR
2004
Springer
111views Education» more  CORR 2004»
15 years 6 months ago
Layout of Graphs with Bounded Tree-Width
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum numb...
Vida Dujmovic, Pat Morin, David R. Wood