Sciweavers

129 search results - page 17 / 26
» Average case analysis of the Boyer-Moore algorithm
Sort
View
AINA
2007
IEEE
14 years 1 months ago
Heuristics for Improving Cryptographic Key Assignment in a Hierarchy
In hierarchical distributed systems, shared data access can be controlled by assigning user groups single cryptographic keys that allow high level users derive low level keys, but...
Anne V. D. M. Kayem, Patrick Martin, Selim G. Akl
KDD
2003
ACM
156views Data Mining» more  KDD 2003»
14 years 7 months ago
Mining distance-based outliers in near linear time with randomization and a simple pruning rule
Defining outliers by their distance to neighboring examples is a popular approach to finding unusual examples in a data set. Recently, much work has been conducted with the goal o...
Stephen D. Bay, Mark Schwabacher
JCB
2002
160views more  JCB 2002»
13 years 7 months ago
Inference from Clustering with Application to Gene-Expression Microarrays
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...
Edward R. Dougherty, Junior Barrera, Marcel Brun, ...
MST
2010
98views more  MST 2010»
13 years 5 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
BMCBI
2008
144views more  BMCBI 2008»
13 years 7 months ago
Pep-3D-Search: a method for B-cell epitope prediction based on mimotope analysis
Background: The prediction of conformational B-cell epitopes is one of the most important goals in immunoinformatics. The solution to this problem, even if approximate, would help...
Yanxin Huang, Yongli Bao, Shu Yan Guo, Yan Wang, C...