Sciweavers

1265 search results - page 134 / 253
» Algorithms for Drawing Media
Sort
View
ALT
2002
Springer
16 years 3 months ago
A Pathology of Bottom-Up Hill-Climbing in Inductive Rule Learning
In this paper, we close the gap between the simple and straight-forward implementations of top-down hill-climbing that can be found in the literature, and the rather complex strate...
Johannes Fürnkranz
CHI
2010
ACM
16 years 1 months ago
Graphemes: self-organizing shape-based clustered structures for network visualisations
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
Ross Shannon, Aaron J. Quigley, Paddy Nixon
SI3D
2009
ACM
16 years 1 months ago
Fast high-quality line visibility
Lines drawn over or in place of shaded 3D models can often provide greater comprehensibility and stylistic freedom that shading alone. A substantial challenge for making stylized ...
Forrester Cole, Adam Finkelstein
ICASSP
2009
IEEE
16 years 1 months ago
Bayesian sparse image reconstruction for MRFM
In this paper, we propose a Bayesian model and a Monte Carlo Markov chain (MCMC) algorithm for reconstructing images that consist of only few non-zero pixels. An appropriate distr...
Nicolas Dobigeon, Alfred O. Hero, Jean-Yves Tourne...
IEEEARES
2008
IEEE
16 years 25 days ago
A Lazy Monitoring Approach for Heartbeat-Style Failure Detectors
—Failure detectors are a fundamental part of safe fault-tolerant distributed systems. Many failure detectors use heartbeats to draw conclusions about the state of nodes within a ...
Benjamin Satzger, Andreas Pietzowski, Wolfgang Tru...