Sciweavers

5086 search results - page 375 / 1018
» The Power of Comparative Reasoning
Sort
View
JMLR
2006
107views more  JMLR 2006»
15 years 6 months ago
Bounds for the Loss in Probability of Correct Classification Under Model Based Approximation
In many pattern recognition/classification problem the true class conditional model and class probabilities are approximated for reasons of reducing complexity and/or of statistic...
Magnus Ekdahl, Timo Koski
156
Voted
ANOR
2002
57views more  ANOR 2002»
15 years 6 months ago
Redefining Event Variables for Efficient Modeling of Continuous-Time Batch Processing
Abstract: We define events so as to reduce the number of events and decision variables needed for modeling batchscheduling problems such as described in [Westenberger and Kallrath ...
Siqun Wang, Monique Guignard
IWOCA
2009
Springer
152views Algorithms» more  IWOCA 2009»
16 years 1 months ago
Better Polynomial Algorithms on Graphs of Bounded Rank-Width
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
Robert Ganian, Petr Hlinený
EUROPAR
2007
Springer
16 years 27 days ago
Hirschberg's Algorithm on a GCA and Its Parallel Hardware Implementation
We present in detail a GCA (Global Cellular Automaton) algorithm with 3n cells for Hirschberg’s algorithm which determines the connected components of a n-node undirected graph w...
Johannes Jendrsczok, Rolf Hoffmann, Jörg Kell...
145
Voted
ICCBR
2005
Springer
16 years 7 days ago
P2P Case Retrieval with an Unspecified Ontology
Traditional CBR approaches imply centralized storage of the case base and, most of them, the retrieval of similar cases by an exhaustive comparison of the case to be solved with th...
Shlomo Berkovsky, Tsvi Kuflik, Francesco Ricci