Sciweavers

4114 search results - page 2 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
ENTCS
2002
207views more  ENTCS 2002»
13 years 5 months ago
Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...
Tadao Takaoka
ECCV
2010
Springer
13 years 2 months ago
An Efficient Graph Cut Algorithm for Computer Vision Problems
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
Chetan Arora, Subhashis Banerjee, Prem Kalra, S. N...
SIAMCOMP
1998
168views more  SIAMCOMP 1998»
13 years 4 months ago
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
Maw-Shang Chang
INFOCOM
2010
IEEE
13 years 3 months ago
Energy Efficient Algorithms for the RFID Estimation Problem
RFID has been gaining popularity for inventory control, object tracking, and supply chain management in warehouses, retail stores, hospitals, etc. Periodically and automatically es...
Tao Li, Samuel Wu, Shigang Chen, Mark Yang
JCB
2002
74views more  JCB 2002»
13 years 5 months ago
Efficient Algorithms for Quantitative Trait Loci Mapping Problems
Kajsa Ljungberg, Sverker Holmgren, Örjan Carl...