Sciweavers

106 search results - page 11 / 22
» Two Element Unavoidable Sets of Partial Words
Sort
View
ICCD
2001
IEEE
120views Hardware» more  ICCD 2001»
14 years 5 months ago
Architectural Enhancements for Fast Subword Permutations with Repetitions in Cryptographic Applications
We propose two new instructions, swperm and sieve, that can be used to efficiently complete an arbitrary bit-level permutation of an n-bit word with or without repetitions. Permut...
John Patrick McGregor, Ruby B. Lee
DBPL
2007
Springer
101views Database» more  DBPL 2007»
14 years 15 days ago
Efficient Inclusion for a Class of XML Types with Interleaving and Counting
Inclusion between XML types is important but expensive, and is much more expensive when unordered types are considered. We prove here that inclusion for XML types with interleavin...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
CIARP
2004
Springer
14 years 2 months ago
Detecting Inflection Patterns in Natural Language by Minimization of Morphological Model
One of the most important steps in text processing and information retrieval is stemming—reducing of words to stems expressing their base meaning, e.g., bake, baked, bakes, bakin...
Alexander F. Gelbukh, Mikhail Alexandrov, Sang-Yon...
SIAMSC
2010
104views more  SIAMSC 2010»
13 years 7 months ago
A New Sobolev Gradient Method for Direct Minimization of the Gross--Pitaevskii Energy with Rotation
Abstract. In this paper we improve traditional steepest descent methods for the direct minimization of the Gross-Pitaevskii (GP) energy with rotation at two levels. We first defi...
Ionut Danaila, Parimah Kazemi
IMAMCI
2010
60views more  IMAMCI 2010»
13 years 7 months ago
Null boundary controllability of a circular elastic arch
We consider a circular arch of thickness ε and curvature r−1 whose elastic deformations are described by a 2×2 system of linear partial differential equation. The system - of...
Arnaud Münch