Sciweavers

4536 search results - page 329 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
PARELEC
2006
IEEE
16 years 23 days ago
Hierarchical Partitioning for Piecewise Linear Algorithms
processor arrays can be used as accelerators for a plenty of data flow-dominant applications. The explosive growth in research and development of massively parallel processor arr...
Hritam Dutta, Frank Hannig, Jürgen Teich
SMI
2006
IEEE
135views Image Analysis» more  SMI 2006»
16 years 23 days ago
Laplace-Beltrami Eigenfunctions Towards an Algorithm That "Understands" Geometry
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of a...
Bruno Lévy
CASCON
2006
117views Education» more  CASCON 2006»
15 years 8 months ago
A backtracking LR algorithm for parsing ambiguous context-dependent languages
Parsing context-dependent computer languages requires an ability to maintain and query data structures while parsing for the purpose of influencing the parse. Parsing ambiguous co...
Adrian D. Thurston, James R. Cordy
DAGSTUHL
2001
15 years 8 months ago
Visualization for the Mind's Eye
Software visualization has been almost exclusively tackled from the visual point of view; this means visualization occurs exclusively through the visual channel. This approach has ...
Nelson A. Baloian, Wolfram Luther
CORR
2004
Springer
176views Education» more  CORR 2004»
15 years 6 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard