Sciweavers

10890 search results - page 436 / 2178
» Automatic Complexity Analysis
Sort
View
WCET
2008
15 years 8 months ago
Towards Predicated WCET Analysis
In this paper, we propose the use of constraint logic programming as a way of modeling contextsensitive execution-times of program segments. The context-sensitive constraints are ...
Amine Marref, Guillem Bernat
COLING
2002
15 years 6 months ago
Fertilization of Case Frame Dictionary for Robust Japanese Case Analysis
This paper proposes a method of fertilizing a Japanese case frame dictionary to handle complicated expressions: double nominative sentences, non-gapping relation of relative claus...
Daisuke Kawahara, Sadao Kurohashi
SIGMOD
2003
ACM
146views Database» more  SIGMOD 2003»
16 years 7 months ago
Estimating Compilation Time of a Query Optimizer
A query optimizer compares alternative plans in its search space to find the best plan for a given query. Depending on the search space and the enumeration algorithm, optimizers v...
Ihab F. Ilyas, Jun Rao, Guy M. Lohman, Dengfeng Ga...
CIKM
2009
Springer
16 years 1 months ago
Semi-nonnegative matrix factorization with global statistical consistency for collaborative filtering
Collaborative Filtering, considered by many researchers as the most important technique for information filtering, has been extensively studied by both academic and industrial co...
Hao Ma, Haixuan Yang, Irwin King, Michael R. Lyu
ICS
2007
Tsinghua U.
16 years 1 months ago
Scheduling FFT computation on SMP and multicore systems
Increased complexity of memory systems to ameliorate the gap between the speed of processors and memory has made it increasingly harder for compilers to optimize an arbitrary code...
Ayaz Ali, S. Lennart Johnsson, Jaspal Subhlok