Sciweavers

7006 search results - page 438 / 1402
» Approximation Algorithms
Sort
View
APPROX
2009
Springer
125views Algorithms» more  APPROX 2009»
15 years 11 months ago
Minimizing Average Shortest Path Distances via Shortcut Edge Addition
We consider adding k shortcut edges (i.e. edges of small fixed length δ ≥ 0) to a graph so as to minimize the weighted average shortest path distance over all pairs of vertices...
Adam Meyerson, Brian Tagiku
127
Voted
ICALP
2004
Springer
15 years 10 months ago
Algorithms for Multi-product Pricing
In the information age, the availability of data on consumer profiles has opened new possibilities for companies to increase their revenue via data mining techniques. One approach...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
140
Voted
ICDM
2003
IEEE
135views Data Mining» more  ICDM 2003»
15 years 10 months ago
An Algorithm for the Exact Computation of the Centroid of Higher Dimensional Polyhedra and its Application to Kernel Machines
The Support Vector Machine (SVM) solution corresponds to the centre of the largest sphere inscribed in version space. Alternative approaches like Bayesian Point Machines (BPM) and...
Frédéric Maire
IJRR
2007
60views more  IJRR 2007»
15 years 4 months ago
Randomized Algorithms for Minimum Distance Localization
We address the problem of minimum distance localization in environments that may contain self-similarities. A mobile robot is placed at an unknown location inside a ¢¤£ self-sim...
Malvika Rao, Gregory Dudek, Sue Whitesides
FSTTCS
2009
Springer
15 years 11 months ago
Algorithms for Message Ferrying on Mobile ad hoc Networks
ABSTRACT. Message Ferrying is a mobility assisted technique for working around the disconnectedness and sparsity of Mobile ad hoc networks. One of the important questions which ari...
Mostafa H. Ammar, Deeparnab Chakrabarty, Atish Das...