Sciweavers

2139 search results - page 134 / 428
» Connecting language to the world
Sort
View
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
16 years 19 days ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma
SENSYS
2004
ACM
15 years 12 months ago
A sensor network application construction kit (SNACK)
We propose a new configuration language, component and service library, and compiler that make it easier to develop efficient sensor network applications. Our goal is the constr...
Ben Greenstein, Eddie Kohler, Deborah Estrin
POPL
2003
ACM
15 years 11 months ago
From control effects to typed continuation passing
First-class continuations are a powerful computational effect, allowing the programmer to express any form of jumping. Types and effect systems can be used to reason about contin...
Hayo Thielecke
WWW
2009
ACM
16 years 7 months ago
SOFIE: a self-organizing framework for information extraction
This paper presents SOFIE, a system for automated ontology extension. SOFIE can parse natural language documents, extract ontological facts from them and link the facts into an on...
Fabian M. Suchanek, Mauro Sozio, Gerhard Weikum
ITICSE
2006
ACM
16 years 12 days ago
One step further the ACM K-12 final report: a proposal for level 1: computer organization for K-8
Teaching computer science to children is a major priority in most countries in the world. Nevertheless, Computer Science curricula do not seem to address the children’s world, c...
Giovanni M. Bianco, Simonetta Tinazzi