2924 search results - page 326 / 585 » Lower Bounds in Distributed Computing |
205
click to vote
SISAP
2008
IEEE
16 years 1 months ago
2008
IEEE
There are several pieces of information that can be utilized in order to improve the efficiency of similarity searches on high-dimensional data. The most commonly used information...
192
click to vote
ICMCS
2007
IEEE
16 years 28 days ago
2007
IEEE
In a Wyner-Ziv video coding system based on turbo codes, parity bits are generated for a Wyner-Ziv frame and transmitted to the decoder. In this context of distributed source codi...
196
click to vote
CIAC
2010
Springer
15 years 11 months ago
2010
Springer
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
157
click to vote
IJCAI
2001
15 years 8 months ago
2001
Combinatorial auctions where bidders can bid on bundles of items can lead to more economical allocations, but determining the winners is NP-complete and inapproximable. We present...
182
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...