3818 search results - page 387 / 764 » Learning from Order Examples |
140
click to vote
QOFIS
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. In this paper, the concept of fairness as a future field of research in computer networks is investigated. We motivate the need of examining fairness issues by providing ...
121
Voted
AAAI
2006
15 years 5 months ago
2006
Constraint programming is a commonly used technology for solving complex combinatorial problems. However, users of this technology need significant expertise in order to model the...
129
click to vote
WSCG
2001
15 years 5 months ago
2001
Imaged-based rendering is a well-known method in computer graphics to achieve photo-realistic images. In this paper we show how conventional image-based rendering algorithms can b...
118
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We reexamine fundamental problems from computational geometry in the word RAM model, where input coordinates are integers that fit in a machine word. We develop a new algorithm fo...
116
Voted
DM
2006
15 years 4 months ago
2006
Let n be a positive integer. A tournament is called n-existentially closed (or n-e.c.) if for every subset S of n vertices and for every subset T of S, there is a vertex x / S whi...