Sciweavers

670 search results - page 103 / 134
» Brain-Like Approximate Reasoning
Sort
View
MFCS
2005
Springer
14 years 3 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
TSD
2005
Springer
14 years 3 months ago
Why Is the Recognition of Spontaneous Speech so Hard?
Although speech, derived from reading texts, and similar types of speech, e.g. that from reading newspapers or that from news broadcast, can be recognized with high accuracy, recog...
Sadaoki Furui, Masanobu Nakamura, Tomohisa Ichiba,...
ICML
2004
IEEE
14 years 3 months ago
Optimising area under the ROC curve using gradient descent
This paper introduces RankOpt, a linear binary classifier which optimises the area under the ROC curve (the AUC). Unlike standard binary classifiers, RankOpt adopts the AUC stat...
Alan Herschtal, Bhavani Raskutti
AIRS
2004
Springer
14 years 3 months ago
On Bit-Parallel Processing of Multi-byte Text
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Ma...
GC
2004
Springer
14 years 3 months ago
A Physics-Style Approach to Scalability of Distributed systems
Abstract. Is it possible to treat large scale distributed systems as physical systems? The importance of that question stems from the fact that the behavior of many P2P systems is ...
Erik Aurell, Sameh El-Ansary