Sciweavers

840 search results - page 114 / 168
» The Complexity of the Extended GCD Problem
Sort
View
COCO
2007
Springer
91views Algorithms» more  COCO 2007»
14 years 3 months ago
Lower Bounds for Multi-Player Pointer Jumping
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
Amit Chakrabarti
LATIN
1998
Springer
14 years 1 months ago
Fast Two-Dimensional Approximate Pattern Matching
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
Ricardo A. Baeza-Yates, Gonzalo Navarro
ALT
2003
Springer
14 years 26 days ago
Efficiently Learning the Metric with Side-Information
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this ...
Tijl De Bie, Michinari Momma, Nello Cristianini
ATAL
2008
Springer
13 years 11 months ago
Regulating air traffic flow with coupled agents
The ability to provide flexible, automated management of air traffic is critical to meeting the ever increasing needs of the next generation air transportation systems. This probl...
Adrian K. Agogino, Kagan Tumer
BMCBI
2010
140views more  BMCBI 2010»
13 years 6 months ago
An improved machine learning protocol for the identification of correct Sequest search results
Background: Mass spectrometry has become a standard method by which the proteomic profile of cell or tissue samples is characterized. To fully take advantage of tandem mass spectr...
Morten Kallberg, Hui Lu