Sciweavers

1819 search results - page 221 / 364
» Computability and Representations of the Zero Set
Sort
View
KDD
1998
ACM
99views Data Mining» more  KDD 1998»
15 years 10 months ago
On the Efficient Gathering of Sufficient Statistics for Classification from Large SQL Databases
For a wide variety of classification algorithms, scalability to large databases can be achieved by observing that most algorithms are driven by a set of sufficient statistics that...
Goetz Graefe, Usama M. Fayyad, Surajit Chaudhuri
3DPVT
2004
IEEE
101views Visualization» more  3DPVT 2004»
15 years 10 months ago
Pyramid Coordinates for Morphing and Deformation
Many model editing operations, such as morphing, blending, and shape deformation, require the ability to interactively transform the surface of a model in response to some control...
Alla Sheffer, Vladislav Kraevoy
DAS
2010
Springer
15 years 9 months ago
Improved classification through runoff elections
We consider the problem of dealing with irrelevant votes when a multi-case classifier is built from an ensemble of binary classifiers. We show how run-off elections can be used to...
Oleg Golubitsky, Stephen M. Watt
AIPS
2010
15 years 8 months ago
Cost-Optimal Factored Planning: Promises and Pitfalls
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
Eric Fabre, Loig Jezequel, Patrik Haslum, Sylvie T...
AAAI
2010
15 years 7 months ago
Coalitional Structure Generation in Skill Games
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...
Yoram Bachrach, Reshef Meir, Kyomin Jung, Pushmeet...