16257 search results - page 337 / 3252 » D-finiteness: algorithms and applications |
200
click to vote
WEA
2007
Springer
16 years 25 days ago
2007
Springer
Algorithms for route planning in transportation networks have recently undergone a rapid development, leading to methods that are up to one million times faster than Dijkstra’s a...
199
click to vote
WEBI
2007
Springer
16 years 25 days ago
2007
Springer
Detecting densely connected subgroups in graphs such as communities in social networks is of interest in many research fields. Several methods have been developed to find commun...
147
click to vote
ICDM
2005
IEEE
16 years 10 days ago
2005
IEEE
Monotonicity is a simple yet significant qualitative characteristic. We consider the problem of segmenting an array in up to K segments. We want segments to be as monotonic as po...
162
click to vote
GECCO
2005
Springer
16 years 7 days ago
2005
Springer
We propose an evolutionary algorithm for the enhancement of digital semi-fragile watermaking based on the manipulation of the image discrete cosine transform (DCT). The algorithm ...
178
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...