Sciweavers

3818 search results - page 321 / 764
» Word Problems on Compressed Words
Sort
View
TALG
2008
97views more  TALG 2008»
15 years 6 months ago
On an infinite family of solvable Hanoi graphs
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
Dany Azriel, Noam Solomon, Shay Solomon
JCB
2007
168views more  JCB 2007»
15 years 6 months ago
Fast Molecular Shape Matching Using Contact Maps
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang
VIROLOGY
2008
121views more  VIROLOGY 2008»
15 years 6 months ago
Constructing malware normalizers using term rewriting
A malware mutation engine is able to transform a malicious program to create a different version of the program. Such mutation engines are used at distribution sites or in self-pro...
Andrew Walenstein, Rachit Mathur, Mohamed R. Chouc...
CORR
2002
Springer
63views Education» more  CORR 2002»
15 years 6 months ago
Robust Classification with Context-Sensitive Features
This paper addresses the problem of classifying observations when features are context-sensitive, especially when the testing set involves a context that is different from the tra...
Peter D. Turney
SIAMJO
2000
101views more  SIAMJO 2000»
15 years 6 months ago
An Efficient Algorithm for Minimizing a Sum of p-Norms
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
Guoliang Xue, Yinyu Ye