Sciweavers

153 search results - page 10 / 31
» An Empirical Analysis of Approximation Algorithms for Euclid...
Sort
View
3DPVT
2006
IEEE
158views Visualization» more  3DPVT 2006»
13 years 11 months ago
Revealing Significant Medial Structure in Polyhedral Meshes
Medial surfaces are popular representations of 3D objects in vision, graphics and geometric modeling. They capture relevant symmetries and part hierarchies and also allow for deta...
Svetlana Stolpner, Kaleem Siddiqi
STACS
2007
Springer
14 years 1 months ago
New Approximation Algorithms for Minimum Cycle Bases of Graphs
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Mich...
CORR
2012
Springer
171views Education» more  CORR 2012»
12 years 3 months ago
Random Feature Maps for Dot Product Kernels
Approximating non-linear kernels using feature maps has gained a lot of interest in recent years due to applications in reducing training and testing times of SVM classifiers and...
Purushottam Kar, Harish Karnick
INFOCOM
2009
IEEE
14 years 2 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
13 years 9 months ago
Clustering for metric and non-metric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Marcel R. Ackermann, Johannes Blömer, Christi...