Sciweavers

3471 search results - page 455 / 695
» Obstacle Numbers of Graphs
Sort
View
ICIP
2000
IEEE
16 years 8 months ago
Shape Approximation Through Recursive Scalable Layer Generation
This paper presents an e cient recursive algorithm for generating operationally optimal intra mode scalable layer decompositions of object contours. The problem is posed in terms ...
Gerry Melnikov, Aggelos K. Katsaggelos
ICC
2009
IEEE
103views Communications» more  ICC 2009»
16 years 1 months ago
On the Minimum k-Connectivity Repair in Wireless Sensor Networks
—Repairing connectivity and achieving a certain level of fault tolerance are two important research challenges in wireless sensor networks that have, in many papers in the litera...
Hisham M. Almasaeid, Ahmed E. Kamal
ADC
2009
Springer
147views Database» more  ADC 2009»
16 years 1 months ago
The Effect of Sparsity on Collaborative Filtering Metrics
This paper presents a detailed study of the behavior of three different content-based collaborative filtering metrics (correlation, cosine and mean squared difference) when they a...
Jesús Bobadilla, Francisco Serradilla
ICIP
2008
IEEE
16 years 1 months ago
Regularized depth from defocus
In the area of depth estimation from images an interesting approach has been structure recovery from defocus cue. Towards this end, there have been a number of approaches [4, 6]. ...
Vinay P. Namboodiri, Subhasis Chaudhuri, Sunil Had...
COCOON
2007
Springer
16 years 24 days ago
On the Complexity of Finding an Unknown Cut Via Vertex Queries
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigi...