Sciweavers

9888 search results - page 302 / 1978
» compute 2009
Sort
View
343
Voted
POPL
2009
ACM
16 years 8 months ago
SPEED: precise and efficient static estimation of program computational complexity
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined qu...
Sumit Gulwani, Krishna K. Mehra, Trishul M. Chilim...
210
Voted
SAC
2009
ACM
16 years 6 days ago
Self-organized control of knowledge generation in pervasive computing systems
Pervasive computing devices (e.g., sensor networks, localization devices, cameras, etc.) are increasingly present in every aspect of our lives. These devices are able to generate ...
Gabriella Castelli, Ronaldo Menezes, Franco Zambon...
CCA
2009
Springer
15 years 11 months ago
Effective Choice and Boundedness Principles in Computable Analysis
Abstract. In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can...
Vasco Brattka, Guido Gherardi
211
Voted
ACMSE
2009
ACM
15 years 11 months ago
Using computer graphics to explore object oriented concepts using C
Most recent graphics courses are what we would call topdown courses. Courses that focus on using graphical packages to implement and teach graphics. The course discussed in this p...
William C. Kreahling
212
Voted
TCC
2009
Springer
124views Cryptology» more  TCC 2009»
16 years 8 months ago
Universally Composable Multiparty Computation with Partially Isolated Parties
It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt a...
Ivan Damgård, Jesper Buus Nielsen, Daniel Wi...