Sciweavers

420 search results - page 50 / 84
» Search on High Degree Graphs
Sort
View
113
Voted
COLING
2000
15 years 2 months ago
An Experiment On Incremental Analysis Using Robust Parsing Techniques
The results of an experiment are presented in which an approach for robust parsing has been applied incrementally. They confirm that due to the robust nature of the underlying tec...
Kilian A. Foth, Wolfgang Menzel, Horia F. Pop, Ing...
83
Voted
AI
2008
Springer
15 years 26 days ago
An experimental evaluation of simplicity in rule learning
While recent research on rule learning has focussed largely on finding highly accurate hypotheses, we evaluate the degree to which these hypotheses are also simple, that is small....
Ulrich Rückert, Luc De Raedt
110
Voted
VRST
1997
ACM
15 years 4 months ago
Managing level of detail through head-tracked peripheral degradation: a model and resulting design principles
Previous work has demonstrated the utility of reductions in the level of detail (LOD) in the periphery of head-tracked, large field of view displays. This paper provides a psychop...
Benjamin Watson, Neff Walker, Larry F. Hodges
117
Voted
SBCCI
2003
ACM
213views VLSI» more  SBCCI 2003»
15 years 6 months ago
Algorithms and Tools for Network on Chip Based System Design
Network on Chip (NoC) is a new paradigm for designing core based System on Chips. It supports high degree of reusability and is scalable. In this paper, an efficient Two-Step Gene...
Tang Lei, Shashi Kumar
ISCA
2012
IEEE
280views Hardware» more  ISCA 2012»
13 years 3 months ago
A case for random shortcut topologies for HPC interconnects
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
Michihiro Koibuchi, Hiroki Matsutani, Hideharu Ama...