Sciweavers

2703 search results - page 80 / 541
» Working Class Hero
Sort
View
FOCS
2005
IEEE
15 years 12 months ago
An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...
Jon M. Kleinberg
TEI
2009
ACM
93views Hardware» more  TEI 2009»
15 years 11 months ago
SurfaceWare: dynamic tagging for Microsoft Surface
Microsoft Surface is distinguished among commercial multi-touch systems by its ability to interact with tagged objects. In this work, we examine a new class of tagged objects wher...
Paul H. Dietz, Benjamin D. Eidelson
SIGCSE
1999
ACM
83views Education» more  SIGCSE 1999»
15 years 10 months ago
Global cooperation project in computer programming course
A Global Cooperation Project was conducted with computer science classes at the Czech Technical University and North Hennepin Community College. The project was a pilot project fo...
Thomas Macek, Bozena Mannova, Josef Kolar, Barbara...
ICFP
1996
ACM
15 years 10 months ago
Inductive, Coinductive, and Pointed Types
An extension of the simply-typed lambda calculus is presented which contains both well-structured inductive and coinductive types, and which also identifies a class of types for w...
Brian T. Howard
CORR
2007
Springer
57views Education» more  CORR 2007»
15 years 6 months ago
On Evaluating the Rate-Distortion Function of Sources with Feed-Forward and the Capacity of Channels with Feedback
— In this work, we study the problem of evaluating the performance limit of two communication problems that are closely related to each other- source coding with feed-forward and...
Ramji Venkataramanan, S. Sandeep Pradhan