10493 search results - page 31 / 2099 » Dynamic Word Problems |
STOC
1994
ACM
13 years 11 months ago
1994
ACM
Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...
STACS
1997
Springer
13 years 12 months ago
1997
Springer
We consider the problem of maintaining a set of n integers in the range 0::2w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum quer...
KDD
2001
ACM
14 years 8 months ago
2001
ACM
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
JAC
2008
13 years 9 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...
IJAC
2010
13 years 6 months ago
2010
We show that the compressed word problem in a finitely generated fully residually free group (F-group) is decidable in polynomial time, and use this result to show that the word ...