Sciweavers

1772 search results - page 209 / 355
» Classifying Problems into Complexity Classes
Sort
View
120
Voted
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
15 years 2 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn
SIAMMAX
2010
103views more  SIAMMAX 2010»
14 years 7 months ago
On Chebyshev Polynomials of Matrices
The mth Chebyshev polynomial of a square matrix A is the monic polynomial that minimizes the matrix 2-norm of p(A) over all monic polynomials p(z) of degree m. This polynomial is u...
Vance Faber, Jörg Liesen, Petr Tichý
117
Voted
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
15 years 2 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
KDD
2006
ACM
191views Data Mining» more  KDD 2006»
16 years 1 months ago
Beyond classification and ranking: constrained optimization of the ROI
Classification has been commonly used in many data mining projects in the financial service industry. For instance, to predict collectability of accounts receivable, a binary clas...
Lian Yan, Patrick Baldasare
ECCV
2010
Springer
15 years 28 days ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof