Sciweavers

4565 search results - page 603 / 913
» Time Optimal Self-Stabilizing Algorithms
Sort
View
STOC
2002
ACM
121views Algorithms» more  STOC 2002»
16 years 3 months ago
Average case analysis for batched disk scheduling and increasing subsequences
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
Eitan Bachmat
130
Voted
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
16 years 3 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
CVPR
2007
IEEE
16 years 1 months ago
Simultaneous Depth Reconstruction and Restoration of Noisy Stereo Images Using Non-local Pixel Distribution
In this paper, we propose a new algorithm that solves both the stereo matching and the image denoising problem simultaneously for a pair of noisy stereo images. Most stereo algorit...
Yong Seok Heo (Seoul National University), Kyoung ...
121
Voted
EVOW
2007
Springer
15 years 9 months ago
Generation of Tree Decompositions by Iterated Local Search
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
Nysret Musliu
ICDCIT
2005
Springer
15 years 8 months ago
Self-stabilizing Deterministic TDMA for Sensor Networks
An algorithm for time division multiple access (TDMA) is desirable in sensor networks for energy management, as it allows a sensor to reduce the amount of idle listening. Also, TD...
Mahesh Arumugam, Sandeep S. Kulkarni