Sciweavers

1249 search results - page 106 / 250
» Limitations of the Even-Mansour Construction
Sort
View
DCC
2008
IEEE
16 years 26 days ago
Coprimitive sets and inextendable codes
Complete (n, r)-arcs in PG(k - 1, q) and projective (n, k, n - r)q-codes that admit no projective extensions are equivalent objects. We show that projective codes of reasonable le...
T. L. Alderson, Aiden A. Bruen

Publication
417views
15 years 10 months ago
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
Peter N. Yianilos
CICLING
2010
Springer
15 years 8 months ago
Lexical Chains Using Distributional Measures of Concept Distance
In practice, lexical chains are typically built using term reiteration or resource-based measures of semantic distance. The former approach misses out on a significant portion of ...
Meghana Marathe, Graeme Hirst
COORDINATION
2009
Springer
15 years 8 months ago
Fairness for Chorded Languages
Joins or chords is a concurrency construct that seems to fit well with the object oriented paradigm. Chorded languages are presented with implicit assumptions regarding the fair t...
Alexis Petrounias, Susan Eisenbach
DATE
2009
IEEE
88views Hardware» more  DATE 2009»
15 years 8 months ago
Rewiring using IRredundancy Removal and Addition
—Redundancy Addition and Removal (RAR) is a restructuring technique used in the synthesis and optimization of logic designs. It can remove an existing target wire and add an alte...
Chun-Chi Lin, Chun-Yao Wang