Sciweavers

14403 search results - page 34 / 2881
» Dynamical Systems Trees
Sort
View
HIPEAC
2009
Springer
14 years 2 months ago
Steal-on-Abort: Improving Transactional Memory Performance through Dynamic Transaction Reordering
Abstract. In transactional memory, aborted transactions reduce performance, and waste computing resources. Ideally, concurrent execution of transactions should be optimally ordered...
Mohammad Ansari, Mikel Luján, Christos Kots...
CGI
2000
IEEE
14 years 2 months ago
Dynamic 3D Maps and Their Texture-Based Design
Three-dimensional maps are fundamental tools for presenting, exploring, and manipulating geo data. This paper describes multiresolution concepts for 3D maps and their texture-base...
Jürgen Döllner, Klaus Hinrichs
CP
2010
Springer
13 years 8 months ago
Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
David Allouche, Simon de Givry, Thomas Schiex
ECCV
2002
Springer
14 years 11 months ago
Dynamic Trees: Learning to Model Outdoor Scenes
Abstract. This paper considers the dynamic tree (DT) model, first introduced in [1]. A dynamic tree specifies a prior over structures of trees, each of which is a forest of one or ...
Nicholas J. Adams, Christopher K. I. Williams
AINA
2005
IEEE
14 years 3 months ago
Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
Bing-Hong Liu, Ming-Jer Tsai, Wei-Chei Ko