Sciweavers

539 search results - page 90 / 108
» Linear complexity of transformed sequences
Sort
View
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
15 years 10 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel
BMCBI
2005
115views more  BMCBI 2005»
14 years 9 months ago
SUPERFICIAL - Surface mapping of proteins via structure-based peptide library design
Background: The determination of protein surfaces and the detection of binding sites are essential to our understanding of protein-protein interactions. Such binding sites can be ...
Andrean Goede, Ines S. Jaeger, Robert Preissner
DAM
2011
14 years 4 months ago
On minimal Sturmian partial words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Francine Blanchet-Sadri, John Lensmire
ECCV
2010
Springer
15 years 3 months ago
Maximum Margin Distance Learning for Dynamic Texture Recognition
The range space of dynamic textures spans spatiotemporal phenomena that vary along three fundamental dimensions: spatial texture, spatial texture layout, and dynamics. By describin...
IJAC
2006
93views more  IJAC 2006»
14 years 9 months ago
On Word Reversing in Braid Groups
It has been conjectured that in a braid group, or more generally in a Garside group, applying any sequence of monotone equivalences and word reversings can increase the length of a...
Patrick Dehornoy, Bert Wiest