5595 search results - page 886 / 1119 » Approximation Algorithms for Clustering Problems |
177
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian sc...
160
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
182
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Abstract--We show that the maximization of the sum degreesof-freedom for the static flat-fading multiple-input multipleoutput (MIMO) interference channel is equivalent to a rank co...
166
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
178
click to vote
CBMS
2006
IEEE
16 years 18 days ago
2006
IEEE
Recognition of shapes in images is an important problem in computer vision with application in various medical problems, including robotic surgery and cell analysis. The similarit...