14161 search results - page 144 / 2833 » On generalized middle-level problem |
114
click to vote
ALGORITHMICA
2005
15 years 17 days ago
2005
Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...
105
click to vote
CVPR
2003
IEEE
16 years 2 months ago
2003
IEEE
This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represen...
118
Voted
JAC
2008
15 years 2 months ago
2008
The problem of compact tables is to maximise the overlap when building a word that is to include permutations of every given words (all the words being the same length). This probl...
100
Voted
TCS
2011
14 years 7 months ago
2011
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...
95
Voted
STACS
2010
Springer
15 years 7 months ago
2010
Springer
Testing whether there is an induced path in a graph spanning k given vertices is already NP-complete in general graphs when k = 3. We show how to solve this problem in polynomial t...