Sciweavers

1686 search results - page 135 / 338
» Programs as polygraphs: computability and complexity
Sort
View
POPL
2003
ACM
16 years 3 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
SIGCSE
2009
ACM
189views Education» more  SIGCSE 2009»
16 years 4 months ago
QuickDraw: bringing graphics into first year
This paper describes a new tool for introducing computer graphics and multimedia applications into first year, called QuickDraw, and our experience using it. QuickDraw provides an...
Ben Stephenson, Craig Taube-Schock
WMTE
2005
IEEE
15 years 9 months ago
SmartTiles: Mobility and Wireless Programmability in Children's Construction and Crafts
This paper presents a working prototype of a mobile, programmable set of construction kit elements for children. SmartTiles are small, lightweight, independently programmable tile...
Nwanua Elumeze, Michael Eisenberg
153
Voted
MIS
2001
Springer
151views Multimedia» more  MIS 2001»
15 years 8 months ago
A Data Model for Querying Wavelet Features in Image Databases
Multimedia databases deal with storage and retrieval of complex descriptors of image contents, called features. Traditional techniques consider features as “black boxes,” ofte...
Simone Santini, Amarnath Gupta
101
Voted
TCS
2002
15 years 3 months ago
Set-sharing is redundant for pair-sharing
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In th...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella