Sciweavers

2100 search results - page 107 / 420
» Fundamentals of the problem
Sort
View
AUTOMATICA
2008
116views more  AUTOMATICA 2008»
15 years 6 months ago
A dynamical systems approach to weighted graph matching
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
Michael M. Zavlanos, George J. Pappas
INFOCOM
2009
IEEE
16 years 1 months ago
Approximation Algorithms for Data Broadcast in Wireless Networks
—Broadcasting is a fundamental operation in wireless networks and plays an important role in the communication protocol design. In multihop wireless networks, however, interferen...
Rajiv Gandhi, Yoo-Ah Kim, Seungjoon Lee, Jiho Ryu,...
SODA
1997
ACM
119views Algorithms» more  SODA 1997»
15 years 7 months ago
Map Labeling and Its Generalizations
Map labeling is of fundamental importance in cartography and geographical information systems and is one of the areas targeted for research by the ACM Computational Geometry Impac...
Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, ...
JCST
2010
189views more  JCST 2010»
15 years 1 months ago
Formally Analyzing Expected Time Complexity of Algorithms Using Theorem Proving
Probabilistic techniques are widely used in the analysis of algorithms to estimate the computational complexity of algorithms or a computational problem. Traditionally, such analys...
Osman Hasan, Sofiène Tahar
ICIP
2000
IEEE
16 years 8 months ago
Texture-Based Segmentation of Satellite Weather Imagery
Unsupervised segmentation of weather images into features that correspond to physical storms is a fundamental and difficult problem. Treating an infrared satellite image as a Mark...
V. Lakshmanan, Victor E. DeBrunner, R. Rabin