12257 search results - page 335 / 2452 » Analysis of Algorithms |
124
click to vote
SPAA
2005
ACM
15 years 9 months ago
2005
ACM
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...
116
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
The tagging problem in natural language processing is to find a way to label every word in a text as a particular part of speech, e.g., proper noun. An effective way of solving th...
143
click to vote
SIGGRAPH
1995
ACM
15 years 7 months ago
1995
ACM
In this paper we introduce a new approach to controlling error in hierarchical clustering algorithms for radiosity. The new method ensures that just enough work is done to meet th...
143
click to vote
TEC
2008
15 years 4 months ago
2008
Under mild conditions, it can be induced from the Karush-Kuhn-Tucker condition that the Pareto set, in the decision space, of a continuous multiobjective optimization problem is (m...
157
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...