Sciweavers

1027 search results - page 202 / 206
» Ordered Vertex Partitioning
Sort
View
JOC
2006
69views more  JOC 2006»
13 years 7 months ago
Characterization of Security Notions for Probabilistic Private-Key Encryption
The development of precise definitions of security for encryption, as well as a detailed understanding of their relationships, has been a major area of research in modern cryptogr...
Jonathan Katz, Moti Yung
PAMI
2008
152views more  PAMI 2008»
13 years 7 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet
TCBB
2008
107views more  TCBB 2008»
13 years 7 months ago
Coclustering of Human Cancer Microarrays Using Minimum Sum-Squared Residue Coclustering
It is a consensus in microarray analysis that identifying potential local patterns, characterized by coherent groups of genes and conditions, may shed light on the discovery of pre...
Hyuk Cho, Inderjit S. Dhillon
BMCBI
2005
89views more  BMCBI 2005»
13 years 7 months ago
An empirical analysis of training protocols for probabilistic gene finders
Background: Generalized hidden Markov models (GHMMs) appear to be approaching acceptance as a de facto standard for state-of-the-art ab initio gene finding, as evidenced by the re...
William H. Majoros, Steven Salzberg
TON
2008
103views more  TON 2008»
13 years 7 months ago
On the race of worms, alerts, and patches
We study the effectiveness of automatic patching and quantify the speed of patch or alert dissemination required for worm containment. We focus on random scanning as this is repres...
Milan Vojnovic, Ayalvadi J. Ganesh