3894 search results - page 603 / 779 » Approximation Algorithms for Biclustering Problems |
131
Voted
ICCV
2003
IEEE
16 years 5 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...
125
Voted
ICCAD
2003
IEEE
16 years 16 days 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 ...
121
Voted
KDD
2009
ACM
15 years 10 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...
127
Voted
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
—Slepian-Wolf coding is a promising distributed source coding technique that can completely remove the data redundancy caused by the spatially correlated observations in wireless...
135
click to vote
CBMS
2006
IEEE
15 years 9 months 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...