Sciweavers

1845 search results - page 188 / 369
» Computing the Angularity Tolerance
Sort
View
129
Voted
PPL
2000
110views more  PPL 2000»
15 years 3 months ago
Faulty Random Geometric Networks
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
Josep Díaz, Jordi Petit, Maria J. Serna
129
Voted
SAC
2008
ACM
15 years 3 months ago
Mining fault-tolerant frequent patterns efficiently with powerful pruning
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...
Jhih-Jie Zeng, Guanling Lee, Chung-Chi Lee
150
Voted
MOBIHOC
2010
ACM
15 years 1 months ago
Data preservation under spatial failures in sensor networks
In this paper, we address the problem of preserving generated data in a sensor network in case of node failures. We focus on the type of node failures that have explicit spatial s...
Navid Hamed Azimi, Himanshu Gupta, Xiaoxiao Hou, J...
163
Voted
CEC
2011
IEEE
14 years 3 months ago
Accelerating convergence towards the optimal pareto front
—Evolutionary algorithms have been very popular optimization methods for a wide variety of applications. However, in spite of their advantages, their computational cost is still ...
Mohsen Davarynejad, Jafar Rezaei, Jos L. M. Vranck...
CVPR
1996
IEEE
16 years 5 months ago
Video Browsing Using Edges and Motion
Automatic video browsing requires algorithms for detecting a variety of events, including production effects (e.g., scene breaks and captions) and moving objects. We present new m...
Ramin Zabih, Justin Miller, Kevin Mai