Sciweavers

2621 search results - page 15 / 525
» Near orders and codes
Sort
View
MDM
2007
Springer
14 years 2 months ago
Near Optimal Update-Broadcast of Data Sets
— We consider the problem of efficiently broadcasting incremental updates to multiple terminals that contain outdated (and possibly different) initial copies of the data. This s...
Sachin Agarwal, Andrew Hagedorn, Ari Trachtenberg
CVPR
2010
IEEE
13 years 10 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
NAACL
2007
13 years 10 months ago
Near-Synonym Choice in an Intelligent Thesaurus
An intelligent thesaurus assists a writer with alternative choices of words and orders them by their suitability in the writing context. In this paper we focus on methods for auto...
Diana Zaiu Inkpen
JCT
2006
67views more  JCT 2006»
13 years 8 months ago
On the coexistence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs
We show that a near resolvable 2-(2k + 1, k, k - 1) design exists if and only if a conference matrix of order 2k + 2 does. A known result on conference matrices then allows us to ...
Malcolm Greig, Harri Haanpää, Petteri Ka...
GLOBECOM
2008
IEEE
14 years 2 months ago
Near-Optimum Power Allocation for Outage Restricted Distributed MIMO Multi-Hop Networks
Abstract—The throughput of multi-hop communication systems can significantly be increased by the application of MIMO concepts. To utilize the physical resources in an efficient...
Dirk Wübben, Yidong Lang