Sciweavers

840 search results - page 106 / 168
» The Complexity of the Extended GCD Problem
Sort
View
ICRA
2010
IEEE
185views Robotics» more  ICRA 2010»
13 years 7 months ago
Heteroscedastic Gaussian processes for data fusion in large scale terrain modeling
This paper presents a novel approach to data fusion for stochastic processes that model spatial data. It addresses the problem of data fusion in the context of large scale terrain ...
Shrihari Vasudevan, Fabio T. Ramos, Eric Nettleton...
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
13 years 7 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
ADC
2010
Springer
204views Database» more  ADC 2010»
13 years 4 months ago
Systematic clustering method for l-diversity model
Nowadays privacy becomes a major concern and many research efforts have been dedicated to the development of privacy protecting technology. Anonymization techniques provide an eff...
Md. Enamul Kabir, Hua Wang, Elisa Bertino, Yunxian...
CORR
2011
Springer
172views Education» more  CORR 2011»
13 years 4 months ago
Improving Strategies via SMT Solving
We consider the problem of computing numerical invariants of programs by abstract interpretation. Our method eschews two traditional sources of imprecision: (i) the use of widenin...
Thomas Martin Gawlitza, David Monniaux
ICDE
2011
IEEE
263views Database» more  ICDE 2011»
13 years 27 days ago
Adding regular expressions to graph reachability and pattern queries
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...