1208 search results - page 75 / 242 » Uniform eventown problems |
CVPR
1999
IEEE
16 years 5 days ago
1999
IEEE
We o er a simple paradigm for tting models, parametric and non-parametric, to noisy data, which resolves some of the problems associated with classic MSE algorithms. This is done ...
CLUSTER
2007
IEEE
15 years 4 months ago
2007
IEEE
— The service-oriented architecture has come a long way in solving the problem of reusability of existing software resources. Grid applications today are composed of a large numb...
MFCS
2007
Springer
15 years 4 months ago
2007
Springer
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. This paper studies the inducement of sequentiality in genetic algorithms (GAs) for uniformly-scaled problems. Sequentiality is a phenomenon in which sub-solutions converg...
COMPGEOM
2009
ACM
15 years 2 months ago
2009
ACM
We study the complexity of the visibility map of terrains whose triangles are fat, not too steep and have roughly the same size. It is known that the complexity of the visibility ...