Sciweavers

1095 search results - page 94 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
112
Voted
FTDCS
2004
IEEE
15 years 6 months ago
Smart Phone: An Embedded System for Universal Interactions
In this paper, we present a system architecture that allows users to interact with embedded systems located in their proximity using Smart Phones. We have identified four models o...
Liviu Iftode, Cristian Borcea, Nishkam Ravi, Porli...
108
Voted
ICRA
2006
IEEE
120views Robotics» more  ICRA 2006»
15 years 8 months ago
Distributed Diagnosis of Coupled Mobile Robots
— Fault diagnosis of coupled mobile robots requires a large number of measurements to be communicated either between the robots or from the robots to a central diagnoser. As comp...
Matthew J. Daigle, Xenofon D. Koutsoukos, Gautam B...
129
Voted
ICDCS
2002
IEEE
15 years 7 months ago
A Fully Distributed Framework for Cost-Sensitive Data Mining
Data mining systems aim to discover patterns and extract useful information from facts recorded in databases. A widely adopted approach is to apply machine learning algorithms to ...
Wei Fan, Haixun Wang, Philip S. Yu, Salvatore J. S...
126
Voted
ECCV
2010
Springer
15 years 7 months ago
The Generalized PatchMatch Correspondence Algorithm
Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
ICDCS
2008
IEEE
15 years 9 months ago
Real-Time Detection of Clone Attacks in Wireless Sensor Networks
A central problem in sensor network security is that sensors are susceptible to physical capture attacks. Once a sensor is compromised, the adversary can easily launch clone attac...
Kai Xing, Fang Liu, Xiuzhen Cheng, David Hung-Chan...