Sciweavers

2343 search results - page 54 / 469
» Structure and Interpretation of Computer Programs
Sort
View
FPCA
1989
15 years 6 months ago
Automatic Complexity Analysis
One way to analyse programs is to to derive expressions for their computational behaviour. A time bound function (or worst-case complexity) gives an upper bound for the computatio...
Mads Rosendahl
POPL
1995
ACM
15 years 6 months ago
A Language with Distributed Scope
Obliq is a lexically-scoped, untyped, interpreted language that supports distributed object-oriented computation. Obliq objects have state and are local to a site. Obliq computati...
Luca Cardelli
SIGCSE
1999
ACM
193views Education» more  SIGCSE 1999»
15 years 6 months ago
Cache conscious programming in undergraduate computer science
The wide-spread use of microprocessor based systems that utilize cache memory to alleviate excessively long DRAM access times introduces a new dimension in the quest to obtain goo...
Alvin R. Lebeck
CVPR
2008
IEEE
16 years 4 months ago
Globally optimal bilinear programming for computer vision applications
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
Manmohan Krishna Chandraker, David J. Kriegman
100
Voted
SIGCSE
2005
ACM
98views Education» more  SIGCSE 2005»
15 years 8 months ago
A multi-institutional investigation of computer science seniors' knowledge of programming concepts
Research on learning suggests the importance of helping students organize their knowledge around meaningful patterns of information. This paper reports on a multi-institutional st...
Laurie Murphy, Renée McCauley, Suzanne West...