Sciweavers

498 search results - page 37 / 100
» Measuring the Complexity of Polygonal Objects
Sort
View
INFOCOM
2005
IEEE
14 years 4 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
TMM
2010
143views Management» more  TMM 2010»
13 years 5 months ago
A Comparison of Perceptually-Based Metrics for Objective Evaluation of Geometry Processing
Recent advances in 3D graphics technologies have led to an increasing use of processing techniques on 3D meshes, such as filtering, compression, watermarking, simplification, defor...
Guillaume Lavoué, Massimiliano Corsini
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 4 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
ASUNAM
2011
IEEE
12 years 11 months ago
Is Objective Function the Silver Bullet? A Case Study of Community Detection Algorithms on Social Networks
Abstract—Community detection or cluster detection in networks is a well-studied, albeit hard, problem. Given the scale and complexity of modern day social networks, detecting “...
Yang Yang, Yizhou Sun, Saurav Pandit, Nitesh V. Ch...
ICASSP
2011
IEEE
13 years 2 months ago
Video object tracking with differential Structural SIMilarity index
The Structural SIMilarity Measure (SSIM) combined with the sequential Monte Carlo approach has been shown [1] to achieve more reliable video object tracking performance, compared ...
Artur Loza, Fanglin Wang, Jie Yang, Lyudmila Mihay...