Sciweavers

11213 search results - page 2006 / 2243
» Low-contention data structures
Sort
View
192
Voted
DGCI
2000
Springer
15 years 10 months ago
Deformable Modeling for Characterizing Biomedical Shape Changes
Abstract. We present a new algorithm for modeling and characterizing shape changes in 3D image sequences of biomedical structures. Our algorithm tracks the shape changes of the obj...
Matthieu Ferrant, Benoit M. Macq, Arya Nabavi, Sim...
CODES
1999
IEEE
15 years 10 months ago
An MPEG-2 decoder case study as a driver for a system level design methodology
We present a case study on the design of a heterogeneous architecture for MPEG-2 video decoding. The primary objective of the case study is the validation of the SPADE methodology...
Pieter van der Wolf, Paul Lieverse, Mudit Goel, Da...
COMPSAC
1999
IEEE
15 years 10 months ago
Dynamic Software Architecture Slicing
As the complexity of software systems increases, so need for a good mechanism of abstraction. architecture design is an abstraction, hiding an immense amount of details about the ...
Taeho Kim, Yeong-Tae Song, Lawrence Chung, Dung T....
DAC
1999
ACM
15 years 10 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther
159
Voted
ICFP
1999
ACM
15 years 10 months ago
Flexible Type Analysis
Run-time type dispatch enables a variety of advanced optimization techniques for polymorphic languages, including tag-free garbage collection, unboxed function arguments, and fla...
Karl Crary, Stephanie Weirich
« Prev « First page 2006 / 2243 Last » Next »