Sciweavers

1272 search results - page 138 / 255
» The Set Cover with Pairs Problem
Sort
View
SIGMOD
2001
ACM
193views Database» more  SIGMOD 2001»
14 years 11 months ago
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
Christian Böhm, Bernhard Braunmüller, Fl...
CVPR
2010
IEEE
14 years 7 months ago
Human Identity Recognition in Aerial Images
Human identity recognition is an important yet underaddressed problem. Previous methods were strictly limited to high quality photographs, where the principal techniques heavily...
Omar Oreifej, Ramin Mehran, and Mubarak Shah
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 7 months ago
Oblivious Buy-at-Bulk in Planar Graphs
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
CVPR
2006
IEEE
15 years 23 days ago
Unsupervised Discovery of Action Classes
In this paper we consider the problem of describing the action being performed by human figures in still images. We will attack this problem using an unsupervised learning approac...
Greg Mori, Hao Jiang, Mark S. Drew, Yang Wang 0003...
CATS
2007
14 years 6 days ago
Constructing Optimal Highways
For two points p and q in the plane, a straight line h, called a highway, and a real v > 1, we define the travel time (also known as the city distance) from p and q to be the ...
Hee-Kap Ahn, Helmut Alt, Tetsuo Asano, Sang Won Ba...