1309 search results - page 149 / 262 » On-Line Difference Maximization |
132
click to vote
SODA
2010
ACM
16 years 21 days ago
2010
ACM
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...
125
click to vote
ICCAD
2005
IEEE
16 years 6 days ago
2005
IEEE
In this paper we propose a novel analog design optimization methodology to address two key aspects of top-down system-level design: (1) how to optimally compare and select analog ...
117
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
Purely bottom-up, unsupervised segmentation of a single
image into two segments remains a challenging task for
computer vision. The co-segmentation problem is the process
of joi...
142
click to vote
HICSS
2009
IEEE
15 years 10 months ago
2009
IEEE
The rapid growth of the Internet has made computer-mediated communication popular and the use of e-negotiation systems (ENS) has attracted great attention from researchers and pra...
137
click to vote
ICDE
2009
IEEE
15 years 10 months ago
2009
IEEE
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...