Sciweavers

1342 search results - page 242 / 269
» Ordered Programs as Abductive Systems
Sort
View
LCPC
2000
Springer
14 years 7 days ago
Efficient Dynamic Local Enumeration for HPF
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
Will Denissen, Henk J. Sips
SDB
1995
178views Database» more  SDB 1995»
14 years 6 days ago
A Semantics-based Approach to Design of Query Languages for Partial Information
Most of work on partial information in databases asks which operations of standard languages, like relational algebra, can still be performed correctly in the presence of nulls. In...
Leonid Libkin
ESANN
2004
13 years 10 months ago
Sparse LS-SVMs using additive regularization with a penalized validation criterion
This paper is based on a new way for determining the regularization trade-off in least squares support vector machines (LS-SVMs) via a mechanism of additive regularization which ha...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
CN
2000
130views more  CN 2000»
13 years 8 months ago
Automating Web navigation with the WebVCR
Recent developments in Web technology such as the inclusion of scripting languages, frames, and the growth of dynamic content, have made the process of retrieving Web content more...
Vinod Anupam, Juliana Freire, Bharat Kumar, Daniel...
CC
2003
Springer
250views System Software» more  CC 2003»
14 years 1 months ago
Automatic Detection of Uninitialized Variables
vel Meta-Reasoning with Higher-Order Abstract Syntax Alberto Momigliano, Simon Ambler. A Normalisation Result for Higher-Order Calculi with Explicit Substitutions Eduardo Bonelli. ...
Thi Viet Nga Nguyen, François Irigoin, Cori...