Sciweavers

6756 search results - page 285 / 1352
» The Structure of Visual Spaces
Sort
View
ICDT
2001
ACM
116views Database» more  ICDT 2001»
15 years 12 months ago
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
Stefan Berchtold, Christian Böhm, Daniel A. K...
SP
1998
IEEE
116views Security Privacy» more  SP 1998»
15 years 11 months ago
Strand Spaces: Why is a Security Protocol Correct?
A strand is a sequence of events; it represents either the execution of legitimate party in a security protocol or else a sequence of actions by a penetrator. A strand space is a ...
F. Javier Thayer, Jonathan C. Herzog, Joshua D. Gu...
ERSHOV
2009
Springer
15 years 11 months ago
Indexing Dense Nested Metric Spaces for Efficient Similarity Search
Abstract. Searching in metric spaces is a very active field since it offers methods for indexing and searching by similarity in collections of unstructured data. These methods sele...
Nieves R. Brisaboa, Miguel Rodríguez Luaces...
ASPDAC
1995
ACM
79views Hardware» more  ASPDAC 1995»
15 years 11 months ago
Search space reduction in high level synthesis by use of an initial circuit
Most existing high-level synthesis(HLS) systems attempt to generate a circuit from a behavioral description \out of the void", using the entire design space as the search dom...
Atsushi Masuda, Hiroshi Imai, Jeffery P. Hansen, M...
AAAI
2000
15 years 8 months ago
Extracting Effective and Admissible State Space Heuristics from the Planning Graph
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches h...
XuanLong Nguyen, Subbarao Kambhampati