Sciweavers

339 search results - page 53 / 68
» Handling dynamic data structures in search based testing
Sort
View
ESA
2003
Springer
111views Algorithms» more  ESA 2003»
14 years 3 months ago
Fast Smallest-Enclosing-Ball Computation in High Dimensions
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
Kaspar Fischer, Bernd Gärtner, Martin Kutz
EDBT
2004
ACM
133views Database» more  EDBT 2004»
14 years 10 months ago
HOPI: An Efficient Connection Index for Complex XML Document Collections
In this paper we present HOPI, a new connection index for XML documents based on the concept of the 2?hop cover of a directed graph introduced by Cohen et al. In contrast to most o...
Ralf Schenkel, Anja Theobald, Gerhard Weikum
CIDR
2003
164views Algorithms» more  CIDR 2003»
13 years 11 months ago
Capacity Bound-free Web Warehouse
Web cache technologies have been developed as an extension of CPU cache, by modifying LRU (Least Recently Used) algorithms. Actually in web cache systems, we can use disks and ter...
Yahiko Kambayashi, Kai Cheng
AH
2008
Springer
14 years 4 months ago
Collection Browsing through Automatic Hierarchical Tagging
In order to navigate huge document collections efficiently, tagged hierarchical structures can be used. For users, it is important to correctly interpret tag combinations. In this ...
Korinna Bade, Marcel Hermkes
ICDCSW
2005
IEEE
14 years 3 months ago
Adaptive Real-Time Anomaly Detection with Improved Index and Ability to Forget
Anomaly detection in IP networks, detection of deviations from what is considered normal, is an important complement to misuse detection based on known attack descriptions. Perfor...
Kalle Burbeck, Simin Nadjm-Tehrani