Sciweavers

11231 search results - page 29 / 2247
» Digging for Data Structures
Sort
View
ATS
2010
IEEE
239views Hardware» more  ATS 2010»
13 years 3 months ago
Efficient Simulation of Structural Faults for the Reliability Evaluation at System-Level
In recent technology nodes, reliability is considered a part of the standard design flow at all levels of embedded system design. While techniques that use only low-level models at...
Michael A. Kochte, Christian G. Zoellin, Rafal Bar...
JMLR
2012
11 years 11 months ago
Randomized Optimum Models for Structured Prediction
One approach to modeling structured discrete data is to describe the probability of states via an energy function and Gibbs distribution. A recurring difficulty in these models is...
Daniel Tarlow, Ryan Prescott Adams, Richard S. Zem...
SOCIALCOM
2010
13 years 6 months ago
Using Text Analysis to Understand the Structure and Dynamics of the World Wide Web as a Multi-Relational Graph
A representation of the World Wide Web as a directed graph, with vertices representing web pages and edges representing hypertext links, underpins the algorithms used by web search...
Harish Sethu, Alexander Yates
WEBDB
2001
Springer
92views Database» more  WEBDB 2001»
14 years 27 days ago
Generating Synthetic Complex-Structured XML Data
Synthetically generated data has always been important for evaluating and understanding new ideas in database research. In this paper, we describe a data generator for generating ...
Ashraf Aboulnaga, Jeffrey F. Naughton, Chun Zhang
WDAG
2009
Springer
130views Algorithms» more  WDAG 2009»
14 years 3 months ago
Contention-Sensitive Data Structures and Algorithms
A contention-sensitive data structure is a concurrent data structure in which the overhead introduced by locking is eliminated in the common cases, when there is no contention, or ...
Gadi Taubenfeld