7129 search results - page 344 / 1426 » Approximation Algorithms for Treewidth |
148
click to vote
VLDB
2004
ACM
15 years 10 months ago
2004
ACM
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
154
click to vote
IPPS
2003
IEEE
15 years 10 months ago
2003
IEEE
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...
145
click to vote
FOCS
2004
IEEE
15 years 8 months ago
2004
IEEE
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...
155
click to vote
SODA
1998
ACM
15 years 6 months ago
1998
ACM
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...
172
click to vote
IS
2006
15 years 4 months ago
2006
In-network data aggregation has been recently proposed as an effective means to reduce the number of messages exchanged in wireless sensor networks. Nodes of the network form an a...