Sciweavers

5012 search results - page 675 / 1003
» Distributed Error Correction
Sort
View
ICIAP
1999
ACM
15 years 11 months ago
Bayesian Graph Edit Distance
ÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matchi...
Richard Myers, Richard C. Wilson, Edwin R. Hancock
COCO
2008
Springer
146views Algorithms» more  COCO 2008»
15 years 8 months ago
A Direct Product Theorem for Discrepancy
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
Troy Lee, Adi Shraibman, Robert Spalek
INFORMS
2008
104views more  INFORMS 2008»
15 years 6 months ago
Estimating Cycle Time Percentile Curves for Manufacturing Systems via Simulation
Cycle time-throughput (CT-TH) percentile curves quantify the relationship between percentiles of cycle time and factory throughput, and they can play an important role in strategi...
Feng Yang, Bruce E. Ankenman, Barry L. Nelson
JMLR
2006
103views more  JMLR 2006»
15 years 6 months ago
Pattern Recognition for Conditionally Independent Data
In this work we consider the task of relaxing the i.i.d. assumption in pattern recognition (or classification), aiming to make existing learning algorithms applicable to a wider r...
Daniil Ryabko
BC
1998
117views more  BC 1998»
15 years 6 months ago
Where did I take that snapshot? Scene-based homing by image matching
In homing tasks, the goal is often not marked by visible objects but must be inferred from the spatial relation to the visual cues in the surrounding scene. The exact computation o...
Matthias O. Franz, Bernhard Schölkopf, Hanspe...