612 search results - page 29 / 123 » Hardness assumptions in the foundations of theoretical compu... |
121
click to vote
ECCV
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We study an energy functional for computing optical flow that combines three assumptions: a brightness constancy assumption, a gradient constancy assumption, and a discon...
FOCS
1994
IEEE
15 years 2 months ago
1994
IEEE
We introduce a new method, called Priority Encoding Transmission, for sending messages over lossy packet-based networks. When a message is to be transmitted, the user speci es a p...
ITICSE
2004
ACM
15 years 3 months ago
2004
ACM
This paper describes an “experiential” learning approach to teaching a foundational course on Computer Networking. In additional to the traditional laboratory sessions and ana...
FOCS
1992
IEEE
15 years 2 months ago
1992
IEEE
Partial types for the -calculus were introduced by Thatte in 1988 [3] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persiste...
SPIN
2010
Springer
14 years 8 months ago
2010
Springer
In this paper, we propose the nevertrace claim, which is a new construct for specifying the correctness properties that either finite or infinite execution traces (i.e., sequence...