7228 search results - page 616 / 1446 » From Algorithmic to Subjective Randomness |
206
click to vote
JGAA
2002
15 years 6 months ago
2002
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...
230
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Since the electricity bill of a data center constitutes a significant portion of its overall operational costs, reducing this has become important. We investigate cost reduction o...
375
click to vote
GECCO
2011
Springer
14 years 10 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
189
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
We consider the problem of ranking refinement, i.e., to improve the accuracy of an existing ranking function with a small set of labeled instances. We are, particularly, intereste...
196
click to vote
CVPR
2007
IEEE
16 years 9 months ago
2007
IEEE
A well-built dataset is a necessary starting point for advanced computer vision research. It plays a crucial role in evaluation and provides a continuous challenge to stateof-the-...