Sciweavers

7123 search results - page 1257 / 1425
» The Ordered Set of Rough Sets
Sort
View
CVPR
2006
IEEE
16 years 8 months ago
Acceleration Strategies for Gaussian Mean-Shift Image Segmentation
Gaussian mean-shift (GMS) is a clustering algorithm that has been shown to produce good image segmentations (where each pixel is represented as a feature vector with spatial and r...
Miguel Á. Carreira-Perpiñán
INFOCOM
2009
IEEE
16 years 1 months ago
Online Bipartite Perfect Matching With Augmentations
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
Kamalika Chaudhuri, Constantinos Daskalakis, Rober...
CIVR
2006
Springer
131views Image Analysis» more  CIVR 2006»
15 years 10 months ago
Exploring the Synergy of Humans and Machines in Extreme Video Retrieval
We introduce an interface for efficient video search that exploits the human ability to quickly scan visual content, after automatic retrieval has arrange the images in expected or...
Alexander G. Hauptmann, Wei-Hao Lin, Rong Yan, Jun...
CORR
2006
Springer
138views Education» more  CORR 2006»
15 years 6 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
STOC
2012
ACM
217views Algorithms» more  STOC 2012»
13 years 9 months ago
Tight lower bounds for the online labeling problem
We consider the file maintenance problem (also called the online labeling problem) in which n integer items from the set {1, . . . , r} are to be stored in an array of size m ≥...
Jan Bulánek, Michal Koucký, Michael ...
« Prev « First page 1257 / 1425 Last » Next »