Sciweavers

380 search results - page 69 / 76
» Generalizing foraging theory for analysis and design
Sort
View
PLDI
2003
ACM
15 years 2 months ago
Checking and inferring local non-aliasing
In prior work [15] we studied a language construct restrict that allows programmers to specify that certain pointers are not aliased to other pointers used within a lexical scope....
Alexander Aiken, Jeffrey S. Foster, John Kodumal, ...
SIGMOD
2010
ACM
250views Database» more  SIGMOD 2010»
15 years 2 months ago
Spreadsheet as a relational database engine
Spreadsheets are among the most commonly used applications for data management and analysis. Perhaps they are even among the most widely used computer applications of all kinds. H...
Jerzy Tyszkiewicz
ACL
2009
14 years 7 months ago
Sentence diagram generation using dependency parsing
Dependency parsers show syntactic relations between words using a directed graph, but comparing dependency parsers is difficult because of differences in theoretical models. We de...
Elijah Mayfield
WWW
2004
ACM
15 years 10 months ago
Semantic email
This paper investigates how the vision of the Semantic Web can be carried over to the realm of email. We introduce a general notion of semantic email, in which an email message co...
Luke McDowell, Oren Etzioni, Alon Y. Halevy, Henry...
STOC
2004
ACM
107views Algorithms» more  STOC 2004»
15 years 9 months ago
Primal-dual algorithms for deterministic inventory problems
We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multi-stage assembly problem. ...
Retsef Levi, Robin Roundy, David B. Shmoys