Sciweavers

ESA
2007
Springer
105views Algorithms» more  ESA 2007»
14 years 3 months ago
Finding Mobile Data: Efficiency vs. Location Inaccuracy
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...
Amotz Bar-Noy, Joanna Klukowska
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
14 years 3 months ago
A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...
Khaled M. Elbassioni, René Sitters, Yan Zha...
ESA
2007
Springer
153views Algorithms» more  ESA 2007»
14 years 3 months ago
Tradeoffs and Average-Case Equilibria in Selfish Routing
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
Martin Hoefer, Alexander Souza
ESA
2007
Springer
108views Algorithms» more  ESA 2007»
14 years 3 months ago
Optimal Resilient Dynamic Dictionaries
Gerth Stølting Brodal, Rolf Fagerberg, Iren...
KDD
2010
ACM
195views Data Mining» more  KDD 2010»
14 years 3 months ago
Universal multi-dimensional scaling
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is m...
Arvind Agarwal, Jeff M. Phillips, Suresh Venkatasu...
KDD
2010
ACM
232views Data Mining» more  KDD 2010»
14 years 3 months ago
Discovering frequent patterns in sensitive data
Discovering frequent patterns from data is a popular exploratory technique in data mining. However, if the data are sensitive (e.g. patient health records, user behavior records) ...
Raghav Bhaskar, Srivatsan Laxman, Adam Smith, Abhr...
DEBS
2010
ACM
14 years 3 months ago
Predictive publish/subscribe matching
A new publish/subscribe capability is presented: the ability to predict the likelihood that a subscription will be matched at some point in the future. Composite subscriptions con...
Vinod Muthusamy, Haifeng Liu, Hans-Arno Jacobsen
COMPGEOM
2010
ACM
14 years 3 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
COMPENG
2010
259views Algorithms» more  COMPENG 2010»
14 years 3 months ago
Propagation of Load Shed in Cascading Line Outages Simulated by OPA
We estimate with a branching process model the propagation of load shed and the probability distribution of load shed in simulated blackouts of an electric power system. The avera...
Janghoon Kim, Ian Dobson
COMPENG
2010
265views Algorithms» more  COMPENG 2010»
14 years 3 months ago
Ontological Framework to Model Critical Infrastructures and their Interdependencies
This paper presents a Knowledge Base System (KBS) as a key component of a federated simulation framework which allows the investigation of (inter)dependencies among Critical Infra...
Elisa Castorini, Paolo Palazzari, Alberto Tofani, ...