Sciweavers

2489 search results - page 22 / 498
» On the Subgroup Distance Problem
Sort
View
CORR
2010
Springer
185views Education» more  CORR 2010»
13 years 7 months ago
A new exponential separation between quantum and classical one-way communication complexity
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
Ashley Montanaro
JDA
2007
97views more  JDA 2007»
13 years 7 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia
ISMB
1997
13 years 8 months ago
A Fast Heuristic Algorithm for a Probe Mapping Problem
Anewheuristic algorithm is presented for mapping probes to locations along the genome,given noisy pairwise distance data as input. Themodel consideredis quite general: Theinput co...
Brendan Mumey
PRL
2006
146views more  PRL 2006»
13 years 7 months ago
Boosting the distance estimation: Application to the K-Nearest Neighbor Classifier
In this work we introduce a new distance estimation technique by boosting and we apply it to the K-Nearest Neighbor Classifier (KNN). Instead of applying AdaBoost to a typical cla...
Jaume Amores, Nicu Sebe, Petia Radeva
AIME
2007
Springer
13 years 9 months ago
Contrast Set Mining for Distinguishing Between Similar Diseases
The task addressed and the method proposed in this paper aim at improved understanding of differences between similar diseases. In particular we address the problem of distinguish...
Petra Kralj, Nada Lavrac, Dragan Gamberger, Antoni...