Sciweavers

1399 search results - page 193 / 280
» New Algorithms for k-Center and Extensions
Sort
View
ICTAI
1992
IEEE
14 years 27 days ago
Automated Parameter Tuning in Stereo Vision Under Time Constraints
This paper presents a method for tuning parameters under a fixed time constraint for a general binocular stereo-vision algorithm. A major difficulty in stereo vision, as well as i...
Steven R. Schwartz, Benjamin W. Wah
FSTTCS
2010
Springer
13 years 6 months ago
The effect of girth on the kernelization complexity of Connected Dominating Set
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
Neeldhara Misra, Geevarghese Philip, Venkatesh Ram...
ICDCS
1999
IEEE
14 years 1 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta
TKDE
2010
200views more  TKDE 2010»
13 years 7 months ago
Incremental and General Evaluation of Reverse Nearest Neighbors
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general in t...
James M. Kang, Mohamed F. Mokbel, Shashi Shekhar, ...
CVIU
2007
128views more  CVIU 2007»
13 years 8 months ago
Iterative relative fuzzy connectedness for multiple objects with multiple seeds
In this paper we present a new theory and an algorithm for image segmentation based on a strength of connectedness between every pair of image elements. The object definition use...
Krzysztof Ciesielski, Jayaram K. Udupa, Punam K. S...