Sciweavers

4539 search results - page 302 / 908
» Approaches to Compute Workflow Complexity
Sort
View
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
STACS
2009
Springer
16 years 1 months ago
Generating Shorter Bases for Hard Random Lattices
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
Joël Alwen, Chris Peikert
WEBI
2009
Springer
16 years 1 months ago
Measuring Inconsistency in DL-Lite Ontologies
Abstract—Measuring Inconsistency in ontologies is an important topic in ontology engineering as it can provide extra information for dealing with inconsistency. Many approaches h...
Liping Zhou, Houkuan Huang, Guilin Qi, Yue Ma, Zhi...
DSN
2007
IEEE
16 years 29 days ago
Fault Tolerant Planning for Critical Robots
Autonomous robots offer alluring perspectives in numerous application domains: space rovers, satellites, medical assistants, tour guides, etc. However, a severe lack of trust in t...
Benjamin Lussier, Matthieu Gallien, Jér&eac...
PG
2007
IEEE
16 years 27 days ago
Radiometric Compensation through Inverse Light Transport
Radiometric compensation techniques allow seamless projections onto complex everyday surfaces. Implemented with projector-camera systems they support the presentation of visual co...
Gordon Wetzstein, Oliver Bimber