849 search results - page 78 / 170 » On the Complexity of the Whitehead Minimization Problem |
JMIV
2006
13 years 7 months ago
2006
Vector field segmentation methods usually belong to either of three classes: methods which segment regions homogeneous in direction and/or norm, methods which detect discontinuiti...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
JCSS
2008
13 years 7 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
ICCSA
2003
Springer
14 years 1 months ago
2003
Springer
A problem of eliminating the unwanted time-harmonic noise on a predetermined region of interest is solved by active means, i.e., by introducing the additional sources of sound, cal...
SIAMCOMP
2002
13 years 7 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...