Sciweavers

4536 search results - page 197 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
GRAPHICSINTERFACE
2007
13 years 11 months ago
Robust pixel classification for 3D modeling with structured light
Modeling 3D objects and scenes is an important part of computer graphics. One approach to modeling is projecting binary patterns onto the scene in order to obtain correspondences ...
Yi Xu, Daniel G. Aliaga
MICCAI
2008
Springer
14 years 10 months ago
Discovering Structure in the Space of Activation Profiles in fMRI
We present a method for discovering patterns of activation observed through fMRI in experiments with multiple stimuli/tasks. We introduce an explicit parameterization for the profi...
Danial Lashkari, Ed Vul, Nancy Kanwisher, Polin...
SWAT
1992
Springer
101views Algorithms» more  SWAT 1992»
14 years 1 months ago
Parallel Algorithms for Priority Queue Operations
This paper presents parallel algorithms for priority queue operations on a p-processor EREWPRAM. The algorithms are based on a new data structure, the Min-path Heap (MH), which is...
Maria Cristina Pinotti, Geppino Pucci
DAGSTUHL
2007
13 years 11 months ago
Multi-Aspect Tagging for Collaborative Structuring
Local tag structures have become frequent through Web 2.0: Users "tag" their data without specifying the underlying semantics. Every user annotates items in an individual...
Katharina Morik, Michael Wurst
DAC
2003
ACM
14 years 10 months ago
An O(nlogn) time algorithm for optimal buffer insertion
The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2 ), where n is the number of possible buffer positions. We present a new a...
Weiping Shi, Zhuo Li