Sciweavers

122 search results - page 14 / 25
» Light types for polynomial time computation in lambda-calcul...
Sort
View
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
AIEDU
2007
86views more  AIEDU 2007»
13 years 7 months ago
A Study of Feedback Strategies in Foreign Language Classrooms and Tutorials with Implications for Intelligent Computer-Assisted
This paper presents two new corpus-based studies of feedback in the domain of teaching Spanish as a foreign language, concentrating on the type and frequency of different feedback ...
Anita Ferreira, Johanna D. Moore, Chris Mellish
PODS
2001
ACM
135views Database» more  PODS 2001»
14 years 7 months ago
On the Complexity of Join Predicates
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins com...
Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Ka...
SBBD
2004
119views Database» more  SBBD 2004»
13 years 8 months ago
Computing the Dependency Basis for Nested List Attributes
Multi-valued dependencies (MVDs) are an important class of constraints that is fundamental for relational database design. Although modern applications increasingly require the su...
Sven Hartmann, Sebastian Link
POPL
2003
ACM
14 years 7 months ago
New results on the computability and complexity of points - to analysis
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
Venkatesan T. Chakaravarthy