Sciweavers

169 search results - page 17 / 34
» The Tree of Hubs Location Problem
Sort
View
ACMSE
2006
ACM
15 years 3 months ago
Phoenix-based clone detection using suffix trees
A code clone represents a sequence of statements that are duplicated in multiple locations of a program. Clones often arise in source code as a result of multiple cut/paste operat...
Robert Tairas, Jeff Gray
ICTAI
2009
IEEE
15 years 8 months ago
Preventing Unwanted Social Inferences with Classification Tree Analysis
A serious threat to user privacy in new mobile and web2.0 applications stems from ‘social inferences’. These unwanted inferences are related to the users’ identity, current ...
Sara Motahari, Sotirios G. Ziavras, Quentin Jones
GLOBECOM
2010
IEEE
14 years 12 months ago
Prolonging Network Lifetime via a Controlled Mobile Sink in Wireless Sensor Networks
In this paper we explore the mobility of a mobile sink in a wireless sensor network (WSN) to prolong the network lifetime. Since the mechanical movement of mobile sink is driven by...
Weifa Liang, Jun Luo, Xu Xu
AGILE
2009
Springer
210views GIS» more  AGILE 2009»
15 years 8 months ago
Detecting Hotspots in Geographic Networks
We study a point pattern detection problem on networks, motivated by geographical analysis tasks, such as crime hotspot detection. Given a network N (for example, a street, train,...
Kevin Buchin, Sergio Cabello, Joachim Gudmundsson,...
127
Voted
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
15 years 3 months ago
Deterministic Sampling Algorithms for Network Design
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
Anke van Zuylen