10457 search results - page 1553 / 2092 » Data Mapping as Search |
193
click to vote
VLSID
2000
IEEE
15 years 11 months ago
2000
IEEE
We consider the problem of timing analysis in the presence of known false paths. The main difficulty in adaptation of classical breadth-first search to the problem is that at each...
161
click to vote
SC
2000
ACM
15 years 11 months ago
2000
ACM
In this paper, we present and evaluate two techniques that use different styles of hardware support to provide data structure specific processor cache information. In one approach...
182
click to vote
SIGIR
2000
ACM
15 years 11 months ago
2000
ACM
We investigate four hierarchical clustering methods (single-link, complete-link, groupwise-average, and single-pass) and two linguistically motivated text features (noun phrase he...
192
click to vote
ACSAC
1999
IEEE
15 years 11 months ago
1999
IEEE
Differentiating anomalous network activity from normal network traffic is difficult and tedious. A human analyst must search through vast amounts of data to find anomalous sequenc...
168
click to vote
HICSS
1998
IEEE
15 years 11 months ago
1998
IEEE
In this paper we present the design and implementation of a distributed index architecture to facilitate metadata discovery on large networks. Many current information discovery s...