20778 search results - page 427 / 4156 » Algorithms for Data Migration |
157
click to vote
KYOTODL
2000
15 years 8 months ago
2000
This paper describes applications of the optimized pattern discover),framework to text and Webmining. In particular; we introduce a class of simple combinatorialpatterns over phra...
127
click to vote
CACM
2008
15 years 7 months ago
2008
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...
172
click to vote
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
169
click to vote
SWAT
1994
Springer
15 years 11 months ago
1994
Springer
We study the complexity of the dynamic partial sum problem in the cell-probe model. We give the model access to nondeterministic queries and prove that the problem remains hard. We...
162
click to vote
CCCG
2006
15 years 8 months ago
2006
We analyze an extremely simple approximation algorithm for computing the minimum enclosing ball (or the 1-center) of a set of points in high dimensions. We prove that this algorit...