Sciweavers

7150 search results - page 323 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
IPPS
2003
IEEE
15 years 12 months ago
Approximate Search Engine Optimization for Directory Service
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...
Kai-Hsiang Yang, Chi-Chien Pan, Tzao-Lin Lee
FOCS
2004
IEEE
15 years 10 months ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
15 years 8 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
INFOCOM
2012
IEEE
13 years 9 months ago
Approximate convex decomposition based localization in wireless sensor networks
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
Wenping Liu, Dan Wang, Hongbo Jiang, Wenyu Liu, Ch...
FSTTCS
1999
Springer
15 years 11 months ago
A Randomized Algorithm for Flow Shop Scheduling
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...
Naveen Garg, Sachin Jain, Chaitanya Swamy