Sciweavers

3710 search results - page 448 / 742
» A new calculus of contexts
Sort
View
MIA
2010
104views more  MIA 2010»
15 years 1 months ago
Combining atlas based segmentation and intensity classification with nearest neighbor transform and accuracy weighted vote
In this paper, different methods to improve atlas based segmentation are presented. The first technique is a new mapping of the labels of an atlas consistent with a given intensit...
Michaël Sdika
CHI
2011
ACM
14 years 10 months ago
Human computation: a survey and taxonomy of a growing field
The rapid growth of human computation within research and industry has produced many novel ideas aimed at organizing web users to do great things. However, the growth is not adequ...
Alexander J. Quinn, Benjamin B. Bederson
EUROCRYPT
2011
Springer
14 years 10 months ago
Faster Explicit Formulas for Computing Pairings over Ordinary Curves
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
Diego F. Aranha, Koray Karabina, Patrick Longa, Ca...
CC
2012
Springer
227views System Software» more  CC 2012»
14 years 2 months ago
Programming Paradigm Driven Heap Analysis
The computational cost and precision of a shape style heap analysis is highly dependent on the way method calls are handled. This paper introduces a new approach to analyzing metho...
Mark Marron, Ondrej Lhoták, Anindya Banerje...
TACAS
2012
Springer
263views Algorithms» more  TACAS 2012»
14 years 2 months ago
Reachability under Contextual Locking
Abstract. The pairwise reachability problem for a multi-threaded program asks, given control locations in two threads, whether they can be simultaneously reached in an execution of...
Rohit Chadha, P. Madhusudan, Mahesh Viswanathan