Sciweavers

494 search results - page 10 / 99
» Heap Building Bounds
Sort
View
ICCV
1998
IEEE
16 years 11 days ago
Wormholes in Shape Space: Tracking Through Discontinuous Changes in Shape
Existing object tracking algorithms generally use some form of local optimisation, assuming that an object's position and shape change smoothly over time. In some situations ...
Tony Heap, David Hogg
ASAP
2007
IEEE
116views Hardware» more  ASAP 2007»
15 years 8 days ago
The Design of a Novel Object-oriented Processor : OOMIPS
A novel object-oriented processor is proposed in this paper, which provides support for object addressing, message passing and dynamic memory management. Object running on this pr...
Weixing Ji, Feng Shi, Baojun Qiao, Muhammad Kamran
90
Voted
CATS
2007
14 years 12 months ago
On the Power of Structural Violations in Priority Queues
We give a priority queue that guarantees the worstcase cost of Θ(1) per minimum finding, insertion, and decrease; and the worst-case cost of Θ(lg n) with at most lg n + O( √ ...
Amr Elmasry, Claus Jensen, Jyrki Katajainen
HPCC
2005
Springer
15 years 4 months ago
Transactional Cluster Computing
A lot of sophisticated techniques and platforms have been proposed to build distributed object systems. Remote method invocation and explicit message passing on top of traditional...
Stefan Frenz, Michael Schöttner, Ralph Gö...
IPPS
2002
IEEE
15 years 3 months ago
Compile/Run-Time Support for Thread Migration
This paper describes a generic mechanism to migrate threads in heterogeneous distributed environments. To maintain high portability and flexibility, thread migration is implement...
Hai Jiang, Vipin Chaudhary