Sciweavers

4865 search results - page 644 / 973
» The Complexity of Graph Connectivity
Sort
View
IPPS
2010
IEEE
15 years 3 months ago
Runtime checking of serializability in software transactional memory
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...
Arnab Sinha, Sharad Malik
SMA
2009
ACM
117views Solid Modeling» more  SMA 2009»
16 years 20 days ago
Discrete physics using metrized chains
Over the last fifty years, there have been numerous efforts to develop from first principles a comprehensive discrete formulation of geometric physics, including Whitney’s ge...
Antonio DiCarlo, Franco Milicchio, Alberto Paoluzz...
ATAL
2010
Springer
15 years 7 months ago
Monotone cooperative games and their threshold versions
Cooperative games provide an appropriate framework for fair and stable resource allocation in multiagent systems. This paper focusses on monotone cooperative games, a class which ...
Haris Aziz, Felix Brandt, Paul Harrenstein
IISWC
2008
IEEE
16 years 18 days ago
Accelerating multi-core processor design space evaluation using automatic multi-threaded workload synthesis
The design and evaluation of microprocessor architectures is a difficult and time-consuming task. Although small, handcoded microbenchmarks can be used to accelerate performance e...
Clay Hughes, Tao Li
CVPR
2008
IEEE
16 years 8 months ago
Learning for stereo vision using the structured support vector machine
We present a random field based model for stereo vision with explicit occlusion labeling in a probabilistic framework. The model employs non-parametric cost functions that can be ...
Yunpeng Li, Daniel P. Huttenlocher