Sciweavers

389 search results - page 60 / 78
» Classifications of bifix codes
Sort
View
CHI
2005
ACM
14 years 8 months ago
Programmatic semantics for natural language interfaces
An important way of making interfaces usable by nonexpert users is to enable the use of natural language input, as in natural language query interfaces to databases, or MUDs and M...
Hugo Liu, Henry Lieberman
CHI
2005
ACM
14 years 8 months ago
Community source development: an emerging model with new opportunities
This paper focuses on an emerging model for software development in higher education: community source. Community source seeks to blend aspects of both open source and traditional...
Dawn Ressel Nidy, Fong Kwok
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
14 years 7 months ago
New degree bounds for polynomial threshold functions
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
Ryan O'Donnell, Rocco A. Servedio
ICSE
2005
IEEE-ACM
14 years 7 months ago
Static analysis tools as early indicators of pre-release defect density
During software development it is helpful to obtain early estimates of the defect density of software components. Such estimates identify fault-prone areas of code requiring furth...
Nachiappan Nagappan, Thomas Ball
ICFP
2003
ACM
14 years 7 months ago
Optimistic evaluation: an adaptive evaluation strategy for non-strict programs
Lazy programs are beautiful, but they are slow because they build many thunks. Simple measurements show that most of these thunks are unnecessary: they are in fact always evaluate...
Robert Ennals, Simon L. Peyton Jones