1919 search results - page 155 / 384 » Recent Extensions to Traviando |
157
click to vote
JISE
1998
15 years 4 months ago
1998
In the framework of perfect loop nests with uniform dependences, tiling has been extensively studied as a source-to-source program transformation. We build upon recent results by ...
126
click to vote
RSA
1998
15 years 4 months ago
1998
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...
157
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
168
click to vote
SIAMJO
2002
15 years 4 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
128
click to vote
TIT
2002
15 years 4 months ago
2002
Various wavelet-based estimators of self-similarity or long-range dependence scaling exponent are studied extensively. These estimators mainly include the (bi)orthogonal wavelet e...