5055 search results - page 283 / 1011 » Relative Timing |
170
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Straight-line programs (SLPs) offer powerful text compression by representing a text T[1, u] in terms of a restricted context-free grammar of n rules, so that T can be r...
181
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Efficient performance tuning of parallel programs is often hard. In this paper we describe an approach that uses a uni-processor execution of a multithreaded program as reference ...
172
click to vote
IJCV
2010
15 years 5 months ago
2010
Humans demonstrate a remarkable ability to parse complicated motion sequences into their constituent structures and motions. We investigate this problem, attempting to learn the st...
168
click to vote
VL
2005
IEEE
16 years 22 days ago
2005
IEEE
What are people currently looking at in their web browser? Do the patterns of pages change over time? Are changes periodic or just related to current events or other factors? We a...
207
click to vote
JMLR
2010
15 years 1 months ago
2010
Hartigan's method for k-means clustering is the following greedy heuristic: select a point, and optimally reassign it. This paper develops two other formulations of the heuri...