Sciweavers

114 search results - page 5 / 23
» The Covert Set-Cover Problem with Application to Network Dis...
Sort
View
APPROX
2010
Springer
154views Algorithms» more  APPROX 2010»
13 years 9 months ago
The Checkpoint Problem
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
ICDE
2005
IEEE
164views Database» more  ICDE 2005»
14 years 8 months ago
Knowledge Discovery from Transportation Network Data
Transportation and Logistics are a major sector of the economy, however data analysis in this domain has remained largely in the province of optimization. The potential of data mi...
Wei Jiang, Jaideep Vaidya, Zahir Balaporia, Chris ...
KDD
2012
ACM
271views Data Mining» more  KDD 2012»
11 years 9 months ago
GigaTensor: scaling tensor analysis up by 100 times - algorithms and discoveries
Many data are modeled as tensors, or multi dimensional arrays. Examples include the predicates (subject, verb, object) in knowledge bases, hyperlinks and anchor texts in the Web g...
U. Kang, Evangelos E. Papalexakis, Abhay Harpale, ...
CCS
2008
ACM
13 years 9 months ago
Secure neighbor discovery in wireless networks: formal investigation of possibility
Wireless communication enables a broad spectrum of applications, ranging from commodity to tactical systems. Neighbor discovery (ND), that is, determining which devices are within...
Marcin Poturalski, Panos Papadimitratos, Jean-Pier...
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 7 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer