3874 search results - page 423 / 775 » Approximation Algorithms for k-hurdle Problems |
163
click to vote
TKDE
2008
15 years 6 months ago
2008
Schema matching is one of the key challenges in information integration. It is a labor-intensive and time-consuming process. To alleviate the problem, many automated solutions have...
161
click to vote
ATMOS
2010
15 years 5 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
175
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
187
click to vote
COMCOM
2006
15 years 6 months ago
2006
Scalability and extended lifetime are two critical design goals of any large scale wireless sensor network. A two-tiered network model has been proposed recently for this purpose....
303
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We propose a framework for compressive sensing of images with local geometric features. Specifically, let x ∈ RN be an N-pixel image, where each pixel p has value xp. The image...