Sciweavers

1275 search results - page 218 / 255
» time 1998
Sort
View
119
Voted
DATE
1998
IEEE
114views Hardware» more  DATE 1998»
15 years 7 months ago
Design Of Future Systems
Near-future linac projects put yet unreached requirements on the LLRF control hardware in both performance and manageability. Meeting their field stability targets requires a clea...
Ian Page
HASE
1998
IEEE
15 years 7 months ago
Combining Various Solution Techniques for Dynamic Fault Tree Analysis of Computer Systems
Fault trees provide a graphical and logical framework for analyzing the reliability of systems. A fault tree provides a conceptually simple modeling framework to represent the sys...
Ragavan Manian, Joanne Bechta Dugan, David Coppit,...
SIGMOD
1998
ACM
142views Database» more  SIGMOD 1998»
15 years 7 months ago
Dimensionality Reduction for Similarity Searching in Dynamic Databases
Databases are increasingly being used to store multi-media objects such as maps, images, audio and video. Storage and retrieval of these objects is accomplished using multi-dimens...
Kothuri Venkata Ravi Kanth, Divyakant Agrawal, Amb...
WG
1998
Springer
15 years 7 months ago
Graphs with Bounded Induced Distance
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
Serafino Cicerone, Gabriele Di Stefano
COCOON
1998
Springer
15 years 7 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...