Sciweavers

17329 search results - page 2829 / 3466
» Improved non-approximability results
Sort
View
ICML
1994
IEEE
15 years 11 months ago
Greedy Attribute Selection
Many real-world domains bless us with a wealth of attributes to use for learning. This blessing is often a curse: most inductive methods generalize worse given too many attributes...
Rich Caruana, Dayne Freitag
KDD
2010
ACM
275views Data Mining» more  KDD 2010»
15 years 10 months ago
Combined regression and ranking
Many real-world data mining tasks require the achievement of two distinct goals when applied to unseen data: first, to induce an accurate preference ranking, and second to give g...
D. Sculley
206
Voted
ACNS
2010
Springer
161views Cryptology» more  ACNS 2010»
15 years 10 months ago
Multi-trail Statistical Saturation Attacks
Abstract. Statistical Saturation Attacks have been introduced and applied to the block cipher PRESENT at CT-RSA 2009. In this paper, we consider their natural extensions. First, we...
Baudoin Collard, François-Xavier Standaert
ICPR
2010
IEEE
15 years 10 months ago
Quasi-Dense Wide Baseline Matching for Three Views
This paper proposes a method for computing a quasi-dense set of matching points between three views of a scene. The method takes a sparse set of seed matches between pairs of view...
Pekka Koskenkorva, Juho Kannala, Sami Sebastian Br...
210
Voted
CPAIOR
2010
Springer
15 years 10 months ago
An In-Out Approach to Disjunctive Optimization
Cutting plane methods are widely used for solving convex optimization problems and are of fundamental importance, e.g., to provide tight bounds for Mixed-Integer Programs (MIPs). T...
Matteo Fischetti, Domenico Salvagnin
« Prev « First page 2829 / 3466 Last » Next »