Sciweavers

9209 search results - page 210 / 1842
» Data Space Randomization
Sort
View
IJSN
2007
73views more  IJSN 2007»
15 years 6 months ago
Optimal worm-scanning method using vulnerable-host distributions
: Most Internet worms use random scanning. The distribution of vulnerable hosts on the Internet, however, is highly non-uniform over the IP-address space. This implies that random ...
Zesheng Chen, Chuanyi Ji
ICDAR
2005
IEEE
15 years 12 months ago
Learning Diagram Parts with Hidden Random Fields
Many diagrams contain compound objects composed of parts. We propose a recognition framework that learns parts in an unsupervised way, and requires training labels only for compou...
Martin Szummer
EDBT
2006
ACM
113views Database» more  EDBT 2006»
15 years 8 months ago
Deferred Maintenance of Disk-Based Random Samples
Random sampling is a well-known technique for approximate processing of large datasets. We introduce a set of algorithms for incremental maintenance of large random samples on seco...
Rainer Gemulla, Wolfgang Lehner
IJCAI
2007
15 years 7 months ago
Training Conditional Random Fields Using Virtual Evidence Boosting
While conditional random fields (CRFs) have been applied successfully in a variety of domains, their training remains a challenging task. In this paper, we introduce a novel trai...
Lin Liao, Tanzeem Choudhury, Dieter Fox, Henry A. ...
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
16 years 6 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...