1568 search results - page 145 / 314 » The problem of examination questions in algorithmics |
141
click to vote
STOC
1992
ACM
15 years 8 months ago
1992
ACM
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
131
click to vote
GFKL
2007
Springer
15 years 8 months ago
2007
Springer
Experimental assessment of the performance of classification algorithms is an important aspect of their development and application on real-world problems. To facilitate this analy...
121
click to vote
STACS
2000
Springer
15 years 8 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
142
click to vote
DAGM
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. High-speed image measurements of fluid flows define an important field of research in experimental fluid mechanics and the related industry. Numerous competing methods ha...
131
Voted
APPROX
2010
Springer
15 years 6 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...