986 search results - page 129 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
108
click to vote
RTCSA
2000
IEEE
15 years 8 months ago
2000
IEEE
One of the hard problems in maintaining real-time systems requirements is to keep track of the impact of resource usage on the applications. Often times, it is not sufficient to ...
101
click to vote
DAM
2007
15 years 4 months ago
2007
The expected number of n-base long sequences consistent with a given SBH spectrum grows exponentially with n, which severely limits the potential range of applicability of SBH even...
104
click to vote
ICCV
1998
IEEE
16 years 6 months ago
1998
IEEE
Proceedings of the 1998 IEEE International Conference on Computer Vision, Bombay, India We introduce a new distance between two distributions that we call the Earth Mover's D...
129
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We consider the following problem: given an unsorted array of n elements, and a sequence of intervals in the array, compute the median in each of the subarrays defined by the inter...
136
click to vote
SODA
2008
ACM
15 years 5 months ago
2008
ACM
The Earth Mover Distance (EMD) between two equalsize sets of points in Rd is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metr...