Sciweavers

572 search results - page 104 / 115
» Exponential-Time Approximation of Hard Problems
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
15 years 10 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
IPSN
2007
Springer
15 years 4 months ago
Hierarchical spatial gossip for multi-resolution representations in sensor networks
In this paper we propose a lightweight algorithm for constructing multi-resolution data representations for sensor networks. We compute, at each sensor node u, O(log n) aggregates...
Rik Sarkar, Xianjin Zhu, Jie Gao
PODC
2004
ACM
15 years 3 months ago
Mechanism design for policy routing
The Border Gateway Protocol (BGP) for interdomain routing is designed to allow autonomous systems (ASes) to express policy preferences over alternative routes. We model these pref...
Joan Feigenbaum, Rahul Sami, Scott Shenker
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
14 years 11 months ago
Context-dependent predictions and cognitive arm control with XCSF
While John Holland has always envisioned learning classifier systems (LCSs) as cognitive systems, most work on LCSs has focused on classification, datamining, and function appro...
Martin V. Butz, Oliver Herbort
CGF
2010
156views more  CGF 2010»
14 years 10 months ago
Mixed Finite Elements for Variational Surface Modeling
Many problems in geometric modeling can be described using variational formulations that define the smoothness of the shape and its behavior w.r.t. the posed modeling constraints....
Alec Jacobson, Elif Tosun, Olga Sorkine, Denis Zor...