Sciweavers

5995 search results - page 1194 / 1199
» Algorithmic Game Theory
Sort
View
DAM
2011
13 years 2 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
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 2 months ago
Complexity of Data Dependence problems for Program Schemas with Concurrency
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
Sebastian Danicic, Robert M. Hierons, Michael R. L...
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 2 months ago
Data Cleaning and Query Answering with Matching Dependencies and Matching Functions
Matching dependencies were recently introduced as declarative rules for data cleaning and entity resolution. Enforcing a matching dependency on a database instance identifies the ...
Leopoldo E. Bertossi, Solmaz Kolahi, Laks V. S. La...
TCBB
2011
13 years 2 months ago
Data Mining on DNA Sequences of Hepatitis B Virus
: Extraction of meaningful information from large experimental datasets is a key element of bioinformatics research. One of the challenges is to identify genomic markers in Hepatit...
Kwong-Sak Leung, Kin-Hong Lee, Jin Feng Wang, Eddi...
TDSC
2011
13 years 2 months ago
Mechanism Design-Based Secure Leader Election Model for Intrusion Detection in MANET
—In this paper, we study leader election in the presence of selfish nodes for intrusion detection in mobile ad hoc networks (MANETs). To balance the resource consumption among a...
Noman Mohammed, Hadi Otrok, Lingyu Wang, Mourad De...
« Prev « First page 1194 / 1199 Last » Next »