Sciweavers

316 search results - page 43 / 64
» Approximation algorithms for hierarchical location problems
Sort
View
MOBIHOC
2006
ACM
14 years 8 months ago
Distributed localization using noisy distance and angle information
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
Amitabh Basu, Jie Gao, Joseph S. B. Mitchell, Giri...
ISSAC
1995
Springer
119views Mathematics» more  ISSAC 1995»
14 years 8 days ago
The Singular Value Decomposition for Polynomial Systems
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
Robert M. Corless, Patrizia M. Gianni, Barry M. Tr...
WINE
2007
Springer
151views Economy» more  WINE 2007»
14 years 2 months ago
Computing Optimal Bundles for Sponsored Search
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
Arpita Ghosh, Hamid Nazerzadeh, Mukund Sundararaja...
ISCC
2006
IEEE
123views Communications» more  ISCC 2006»
14 years 2 months ago
Similarity Search in a Hybrid Overlay P2P Network
P2P systems are increasingly used to discover and share various data between users. The performance of a P2P based information retrieval system is determined by the efficiency of...
Mouna Kacimi, Kokou Yétongnon
ATMOS
2010
134views Optimization» more  ATMOS 2010»
13 years 7 months ago
Vertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Holger Flier, Matús Mihalák, Anita S...