Sciweavers

15485 search results - page 211 / 3097
» Computing Optimal Subsets
Sort
View
161
Voted
DAC
1996
ACM
15 years 10 months ago
Techniques for Verifying Superscalar Microprocessors
Burch and Dill [3] described an automatic method for verifying a pipelined processor against its instruction setarchitecture(ISA). We describethree techniquesfor improving this me...
Jerry R. Burch
137
Voted
GD
2000
Springer
15 years 10 months ago
Fast Layout Methods for Timetable Graphs
Abstract. Timetable graphs are used to analyze transportation networks. In their visualization, vertex coordinates are fixed to preserve the underlying geography, but due to small ...
Ulrik Brandes, Galina Shubina, Roberto Tamassia, D...
IJNSEC
2008
103views more  IJNSEC 2008»
15 years 6 months ago
General Group Oriented ID-based Cryptosystems with Chosen Plaintext Security
A scheme for general group oriented ID-based cryptosystems is proposed. This scheme allows an authorized subset in the general access structure to cooperatively decrypt the cipher...
Chunxiang Xu, Junhui Zhou, Guozhen Xiao
DCC
1998
IEEE
15 years 6 months ago
Quasideterminant Characterization of MDS Group Codes over Abelian Groups
A group code defined over a group G is a subset of Gn which forms a group under componentwise group operation. The well known matrix characterization of MDS (Maximum Distance Sepa...
A. A. Zain, B. Sundar Rajan
200
Voted
ACL
2009
15 years 4 months ago
Comparing the Accuracy of CCG and Penn Treebank Parsers
We compare the CCG parser of Clark and Curran (2007) with a state-of-the-art Penn Treebank (PTB) parser. An accuracy comparison is performed by converting the CCG derivations into...
Stephen Clark, James R. Curran