1647 search results - page 269 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
STOC
2007
ACM
14 years 9 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
TON
2008
13 years 8 months ago
2008
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
RECOMB
2004
Springer
14 years 9 months ago
2004
Springer
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
ICDE
2010
IEEE
14 years 3 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
ICIP
2008
IEEE
14 years 10 months ago
2008
IEEE
This paper addresses the face hallucination problem of converting thermal infrared face images into photo-realistic ones. It is a challenging task because the two modalities are o...