Sciweavers

47 search results - page 9 / 10
» The Black-Box Complexity of Nearest Neighbor Search
Sort
View
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 5 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 5 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
PR
2007
116views more  PR 2007»
13 years 4 months ago
GAPS: A clustering method using a new point symmetry-based distance measure
In this paper, an evolutionary clustering technique is described that uses a new point symmetry-based distance measure. The algorithm is therefore able to detect both convex and n...
Sanghamitra Bandyopadhyay, Sriparna Saha
W2GIS
2004
Springer
13 years 10 months ago
Expansion-Based Algorithms for Finding Single Pair Shortest Path on Surface
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
Ke Deng, Xiaofang Zhou
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
13 years 10 months ago
Prior Entanglement, Message Compression and Privacy in Quantum Communication
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen