Sciweavers

1369 search results - page 156 / 274
» Lattice computations for random numbers
Sort
View
ICML
2004
IEEE
14 years 10 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
14 years 2 months ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...
EMS
2008
IEEE
13 years 11 months ago
Threat Modeling Revisited: Improving Expressiveness of Attack
Threat modeling plays an important role in the deployment of optimal security controls and a number of threat modeling techniques have been proposed. However, most of the existing...
Drake Patrick Mirembe, Maybin K. Muyeba
TON
2002
175views more  TON 2002»
13 years 8 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
ALT
2003
Springer
14 years 6 months ago
Learning a Subclass of Regular Patterns in Polynomial Time
An algorithm for learning a subclass of erasing regular pattern languages is presented. On extended regular pattern languages generated by patterns π of the form x0α1x1 . . . α...
John Case, Sanjay Jain, Rüdiger Reischuk, Fra...