Sciweavers

6365 search results - page 58 / 1273
» Fast Local Computation Algorithms
Sort
View
127
Voted
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 5 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
106
Voted
AIPS
2004
15 years 2 months ago
Incremental Maximum Flows for Fast Envelope Computation
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
Nicola Muscettola
114
Voted
ISPEC
2010
Springer
15 years 5 months ago
On Fast and Approximate Attack Tree Computations
Abstract. In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algo...
Aivo Jürgenson, Jan Willemson