Sciweavers

4451 search results - page 170 / 891
» On Random Ordering Constraints
Sort
View
KSEM
2009
Springer
15 years 11 months ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer
150
Voted
ESA
2004
Springer
145views Algorithms» more  ESA 2004»
15 years 10 months ago
Flows on Few Paths: Algorithms and Lower Bounds
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
Maren Martens, Martin Skutella
ICDAR
2007
IEEE
15 years 11 months ago
Using Random Forests for Handwritten Digit Recognition
In the Pattern Recognition field, growing interest has been shown in recent years for Multiple Classifier Systems and particularly for Bagging, Boosting and Random Subspaces. Th...
Simon Bernard, Sébastien Adam, Laurent Heut...
119
Voted
EMNLP
2008
15 years 6 months ago
Syntactic Constraints on Paraphrases Extracted from Parallel Corpora
We improve the quality of paraphrases extracted from parallel corpora by requiring that phrases and their paraphrases be the same syntactic type. This is achieved by parsing the E...
Chris Callison-Burch
AAAI
2006
15 years 6 months ago
Supporting Queries with Imprecise Constraints
In this paper, we motivate the need for and challenges involved in supporting imprecise queries over Web databases. Then we briefly explain our solution, AIMQ - a domain independe...
Ullas Nambiar, Subbarao Kambhampati