68 search results - page 6 / 14 » Efficient Pairing Computation with Theta Functions |
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
TIT
2008
13 years 7 months ago
2008
Abstract--We investigate the problem of finding minimum-distortion policies for streaming delay-sensitive but distortion-tolerant data. We consider cross-layer approaches which exp...
IVC
2006
13 years 7 months ago
2006
When space points and camera optical center lie on a twisted cubic, no matter how many pairs there are used from the space points to their image points, camera parameters cannot b...
TCS
2008
13 years 7 months ago
2008
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...