Sciweavers

1388 search results - page 130 / 278
» Approximability of Robust Network Design
Sort
View
ICIP
2000
IEEE
15 years 8 months ago
Vector Probability Diffusion
Minimal surface regularization has been used in several applications ranging from stereo to image segmentation, sometimes hidden as a graph-cut discrete formulation, or as a stric...
Alvaro Pardo, Guillermo Sapiro
ICIP
1995
IEEE
15 years 7 months ago
Fast image search using a multiscale stochastic model
Searching an image for the occurrence of a pattern or a template is an essential step in a number of image processing applications. We propose a new multiresolution matching crite...
S. Sista, Charles A. Bouman, Jan P. Allebach
136
Voted
MP
1998
109views more  MP 1998»
15 years 3 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
132
Voted
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 7 days ago
Oblivious Buy-at-Bulk in Planar Graphs
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
167
Voted
GLOBECOM
2007
IEEE
15 years 10 months ago
Non-Cooperative Power Control for Faded Wireless Ad Hoc Networks
— The problem of non-cooperative power control is studied for wireless ad hoc networks supporting data services. We develop a maximum throughput based non-cooperative power contr...
Xiaolu Zhang, Meixia Tao, Chun Sum Ng