Sciweavers

762 search results - page 6 / 153
» Finding SHA-1 Characteristics: General Results and Applicati...
Sort
View
SDM
2004
SIAM
194views Data Mining» more  SDM 2004»
13 years 8 months ago
Finding Frequent Patterns in a Large Sparse Graph
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
Michihiro Kuramochi, George Karypis
MICRO
1998
IEEE
144views Hardware» more  MICRO 1998»
13 years 11 months ago
Analyzing the Working Set Characteristics of Branch Execution
To achieve highly accurate branch prediction, it is necessary not only to allocate more resources to branch prediction hardware but also to improve the understanding of branch exe...
Sangwook P. Kim, Gary S. Tyson
VLSID
2005
IEEE
167views VLSI» more  VLSID 2005»
14 years 7 months ago
A Methodology and Tooling Enabling Application Specific Processor Design
This paper presents a highly efficient processor design methodology based on the LISA 2.0 language. Typically the architecture design phase is dominated by an iterative processor ...
Andreas Hoffmann, Frank Fiedler, Achim Nohl, Suren...
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 7 months ago
Distance Distributions in Finite Uniformly Random Networks: Theory and Applications
In wireless networks, the knowledge of nodal distances is essential for performance analysis and protocol design. When determining distance distributions in random networks, the u...
Sunil Srinivasa, Martin Haenggi
PARMA
2004
174views Database» more  PARMA 2004»
13 years 8 months ago
Finding Spatial Patterns in Network Data
Data on modern networks are massive and are applied in the area of monitoring and analyzing activities at the network element, network-wide, and customer and service levels for a h...
Roland Heilmann, Daniel A. Keim, Christian Panse, ...