2107 search results - page 137 / 422 » Computing Small Search Numbers in Linear Time |
132
click to vote
WWW
2007
ACM
16 years 4 months ago
2007
ACM
The aggregation and comparison of behavioral patterns on the WWW represent a tremendous opportunity for understanding past behaviors and predicting future behaviors. In this paper...
118
click to vote
STACS
2009
Springer
15 years 10 months ago
2009
Springer
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
140
click to vote
RANDOM
1999
Springer
15 years 7 months ago
1999
Springer
Abstract. We consider approximate PCPs for multidimensional bin-packing problems. In particular, we show how a verifier can be quickly convinced that a set of multidimensional blo...
137
Voted
INFOVIS
2003
IEEE
15 years 8 months ago
2003
IEEE
An algorithm is presented for the visualisation of multidimensional abstract data, building on a hybrid model introduced at InfoVis 2002. The most computationally complex stage of...
136
click to vote
DAC
2003
ACM
16 years 4 months ago
2003
ACM
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...