65 search results - page 10 / 13 » Two Polynomial Time Algorithms for the Metro-line Crossing M... |
124
click to vote
IPPS
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
141
click to vote
IPL
2010
15 years 3 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
135
click to vote
ICDT
2005
ACM
15 years 10 months ago
2005
ACM
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
134
click to vote
CGO
2003
IEEE
15 years 8 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...
123
Voted
CVPR
2010
IEEE
16 years 25 days ago
2010
IEEE
We present an automatic method that establishes 3D correspondence between isometric shapes. Our goal is to find an optimal correspondence between two given (nearly) isometric sha...