Sciweavers

7129 search results - page 180 / 1426
» Approximation Algorithms for Treewidth
Sort
View
122
Voted
UAI
2004
15 years 5 months ago
On-line Prediction with Kernels and the Complexity Approximation Principle
The paper describes an application of Aggregating Algorithm to the problem of regression. It generalizes earlier results concerned with plain linear regression to kernel technique...
Alexander Gammerman, Yuri Kalnishkan, Vladimir Vov...
128
Voted
COMPGEOM
2007
ACM
15 years 7 months ago
Medial axis approximation from inner Voronoi balls: a demo of the Mesecina tool
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...
Balint Miklos, Joachim Giesen, Mark Pauly
162
Voted
PODS
2012
ACM
276views Database» more  PODS 2012»
13 years 6 months ago
Randomized algorithms for tracking distributed count, frequencies, and ranks
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
Zengfeng Huang, Ke Yi, Qin Zhang
257
Voted
INFOCOM
2012
IEEE
13 years 6 months ago
A robust boundary detection algorithm based on connectivity only for 3D wireless sensor networks
—In this work we develop a distributed boundary detection algorithm, dubbed Coconut, for 3D wireless sensor networks. It first constructs a tetrahedral structure to delineate th...
Hongyu Zhou, Hongyi Wu, Miao Jin
106
Voted
ISAAC
2007
Springer
124views Algorithms» more  ISAAC 2007»
15 years 9 months ago
Approximating the Crossing Number of Toroidal Graphs
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
Petr Hlinený, Gelasio Salazar