1568 search results - page 227 / 314 » The problem of examination questions in algorithmics |
175
click to vote
COMPGEOM
2004
ACM
15 years 8 months ago
2004
ACM
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...
123
click to vote
MP
2006
15 years 4 months ago
2006
The max-cut and stable set problems are two fundamental NP-hard problems in combinatorial optimization. It has been known for a long time that any instance of the stable set probl...
118
click to vote
VLDB
2001
ACM
15 years 8 months ago
2001
ACM
Bulk loading refers to the process of creating an index from scratch for a given data set. This problem is well understood for B-trees, but so far, non-traditional index structure...
146
Voted
GECCO
2010
Springer
15 years 7 months ago
2010
Springer
Multiobjective optimization in general aims at learning about the problem at hand. Usually the focus lies on objective space properties such as the front shape and the distributio...
136
click to vote
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
In this paper, we address the problem of detecting pedestrians in crowded real-world scenes with severe overlaps. Our basic premise is that this problem is too difficult for any t...