Sciweavers

7342 search results - page 1175 / 1469
» Optimal Language Learning
Sort
View
LFP
1992
153views more  LFP 1992»
15 years 5 months ago
Reasoning About Programs in Continuation-Passing Style
The CPS transformation dates back to the early 1970's, where it arose as a technique to represent the control flow of programs in -calculus based programming languages as -te...
Amr Sabry, Matthias Felleisen
JAIR
2008
103views more  JAIR 2008»
15 years 4 months ago
ICE: An Expressive Iterative Combinatorial Exchange
We present the design and analysis of the first fully expressive, iterative combinatorial exchange (ICE). The exchange incorporates a tree-based bidding language (TBBL) that is co...
Benjamin Lubin, Adam I. Juda, Ruggiero Cavallo, S&...
JSS
2006
99views more  JSS 2006»
15 years 3 months ago
A tunable hybrid memory allocator
Dynamic memory management can make up to 60% of total program execution time. Object oriented languages such as C++ can use 20 times more memory than procedural languages like C. ...
Yusuf Hasan, J. Morris Chang
TCS
1998
15 years 3 months ago
Foundations of Aggregation Constraints
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...
Kenneth A. Ross, Divesh Srivastava, Peter J. Stuck...
EMNLP
2010
15 years 2 months ago
Constraints Based Taxonomic Relation Classification
Determining whether two terms in text have an ancestor relation (e.g. Toyota and car) or a sibling relation (e.g. Toyota and Honda) is an essential component of textual inference ...
Quang Do, Dan Roth
« Prev « First page 1175 / 1469 Last » Next »