3874 search results - page 457 / 775 » Approximation Algorithms for k-hurdle Problems |
261
click to vote
GIS
2007
ACM
16 years 7 months ago
2007
ACM
This work addresses the problem of obtaining the degree of similarity between trajectories of moving objects. Typically, a Moving Objects Database (MOD) contains sequences of (loc...
164
click to vote
ESA
2009
Springer
16 years 25 days ago
2009
Springer
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
183
click to vote
EMMCVPR
2005
Springer
15 years 11 months ago
2005
Springer
This paper addresses the problem of efficient information theoretic, non-parametric data clustering. We develop a procedure for adapting the cluster memberships of the data pattern...
150
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
150
click to vote
HICSS
2003
IEEE
15 years 11 months ago
2003
IEEE
In the paper, we propose a general method for statistical performance evaluation. The method incorporates various statistical metrics and automatically selects an appropriate stat...