Sciweavers

100 search results - page 18 / 20
» Let's not Argue about Semantics
Sort
View
JBCS
2010
85views more  JBCS 2010»
13 years 5 months ago
OWL schema matching
Schema matching is a fundamental issue to many database applications, such as query mediation and data warehousing. It becomes a challenge when different vocabularies are used to r...
Luiz André P. Paes Leme, Marco A. Casanova,...
PPOPP
2012
ACM
12 years 6 months ago
Internally deterministic parallel algorithms can be fast
The virtues of deterministic parallelism have been argued for decades and many forms of deterministic parallelism have been described and analyzed. Here we are concerned with one ...
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gib...
COGSCI
2010
125views more  COGSCI 2010»
13 years 11 months ago
A Probabilistic Computational Model of Cross-Situational Word Learning
Words are the essence of communication: they are the building blocks of any language. Learning the meaning of words is thus one of the most important aspects of language acquisiti...
Afsaneh Fazly, Afra Alishahi, Suzanne Stevenson
PEPM
2011
ACM
13 years 1 months ago
Adaptation-based programming in java
Writing deterministic programs is often difficult for problems whose optimal solutions depend on unpredictable properties of the programs’ inputs. Difficulty is also encounter...
Tim Bauer, Martin Erwig, Alan Fern, Jervis Pinto
POPL
2006
ACM
14 years 11 months ago
On flow-sensitive security types
This article investigates formal properties of a family of semantically sound flow-sensitive type systems for tracking information flow in simple While programs. The family is ind...
Sebastian Hunt, David Sands