Search
Now showing items 521-530 of 648
Enhanced Visual Authoring Using Operation History
(2009-06-24)
Graphical editors have introduced great flexibility to the designer's workflow, providing powerful digital tools and enabling the creation of complex and compelling designs. This thesis presents methods for improving these ...
An integrated model of visual attention using shape-based features
(2009-06-20)
Apart from helping shed some light on human perceptual mechanisms, modeling visual attention has important applications in computer vision. It has been shown to be useful in priming object detection, pruning interest points, ...
Interactive Visual Histories for Vector Graphics
(2009-06-24)
Presentation and graphics software enables users to experiment with variations of illustrations. They can revisit recent editing operations using the ubiquitous undo command, but they are limited to sequential exploration. ...
Keeping Mobile Robots Connected
(2009-06-17)
Designing robust algorithms for mobile agents with reliable communication is difficult due to the distributed nature of computation, in mobile ad hoc networks (MANETs) the matter is exacerbated by the need to ensure ...
Programming Manifolds
(2007)
Many programming domains involve the manipulation of values distributed through a manifold - examples include sensor networks, smart materials, and biofilms. This paper describes a programming semantics for manifolds based ...
The Guided Improvement Algorithm for Exact, General-Purpose, Many-Objective Combinatorial Optimization
(2009-07-03)
This paper presents a new general-purpose algorithm for exact solving of combinatorial many-objective optimization problems. We call this new algorithm the guided improvement algorithm. The algorithm is implemented on top ...
Partitioning Strategies for Concurrent Programming
(2009-06-16)
This work presents four partitioning strategies, or patterns, useful for decomposing a serial application into multiple concurrently executing parts. These partitioning strategies augment the commonly used task and data ...
A Useful Homomorphic Encryption Method
(2009-06-15)
Generalized Conflict Learning For Hybrid Discrete Linear Optimization
(2005-05-20)
Conflict-directed search algorithms have formed the core of practical, model-based reasoning systems for the last three decades. In many of these applications there is a series of discrete constraint optimization problems ...
Safe Open-Nested Transactions Through Ownership
(2008-02-20)
Researchers in transactional memory (TM) have proposed open nesting asa methodology for increasing the concurrency of a program. The ideais to ignore certain "low-level" memory operations of anopen-nested transaction when ...