Sciweavers

1283 search results - page 92 / 257
» Probabilistic structured query methods
Sort
View
CCS
2004
ACM
15 years 5 months ago
Payload attribution via hierarchical bloom filters
Payload attribution is an important problem often encountered in network forensics. Given an excerpt of a payload, finding its source and destination is useful for many security ...
Kulesh Shanmugasundaram, Hervé Brönnim...
PAMI
2012
13 years 2 months ago
A Tree-Based Context Model for Object Recognition
—There has been a growing interest in exploiting contextual information in addition to local features to detect and localize multiple object categories in an image. A context mod...
Myung Jin Choi, Antonio Torralba, Alan S. Willsky
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
16 years 5 days ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
IJUFKS
2007
108views more  IJUFKS 2007»
14 years 11 months ago
Resampling for Fuzzy Clustering
Abstract. Resampling methods are among the best approaches to determine the number of clusters in prototype-based clustering. The core idea is that with the right choice for the nu...
Christian Borgelt
LICS
2000
IEEE
15 years 4 months ago
Automatic Structures
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
Achim Blumensath, Erich Grädel