Sciweavers

314 search results - page 57 / 63
» Succinct nearest neighbor search
Sort
View
ICAISC
2010
Springer
13 years 10 months ago
Do We Need Whatever More Than k-NN?
Abstract. Many sophisticated classification algorithms have been proposed. However, there is no clear methodology of comparing the results among different methods. According to ou...
Miroslaw Kordos, Marcin Blachnik, Dawid Strzempa
AMR
2008
Springer
248views Multimedia» more  AMR 2008»
13 years 9 months ago
Mobile Museum Guide Based on Fast SIFT Recognition
Abstract. This article explores the feasibility of a market-ready, mobile pattern recognition system based on the latest findings in the field of object recognition and currently a...
Boris Ruf, Effrosini Kokiopoulou, Marcin Detynieck...
ALENEX
2001
151views Algorithms» more  ALENEX 2001»
13 years 9 months ago
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
The purpose of this paper is to provide a preliminary report on the rst broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem ATSP....
Jill Cirasella, David S. Johnson, Lyle A. McGeoch,...
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 8 months ago
On the Outage Capacity of a Practical Decoder Using Channel Estimation Accuracy
— The optimal decoder achieving the outage capacity under imperfect channel estimation is investigated. First, by searching into the family of nearest neighbor decoders, which ca...
Pablo Piantanida, Sajad Sadough, Pierre Duhamel
CORR
2007
Springer
109views Education» more  CORR 2007»
13 years 8 months ago
On the Outage Capacity of a Practical Decoder Accounting for Channel Estimation Inaccuracies
—The optimal decoder achieving the outage capacity under imperfect channel estimation is investigated. First, by searching into the family of nearest neighbor decoders, which can...
Pablo Piantanida, Sajad Sadough, Pierre Duhamel