Sciweavers

87 search results - page 10 / 18
» Roughness bounds in rough set operations
Sort
View
FUIN
2007
121views more  FUIN 2007»
15 years 1 months ago
A Possibility-Theoretic View of Formal Concept Analysis
Abstract. The paper starts from the standard relational view linking objects and properties in formal concept analysis, here augmented with four modal-style operators (known as suf...
Didier Dubois, Florence Dupin de Saint-Cyr, Henri ...
ICPR
2002
IEEE
16 years 2 months ago
The Trimmed Iterative Closest Point Algorithm
The problem of geometric alignment of two roughly preregistered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension o...
Dmitry Chetverikov, D. Svirko, Dmitry Stepanov, Pa...
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
15 years 8 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
ATAL
2006
Springer
15 years 5 months ago
Learning against multiple opponents
We address the problem of learning in repeated N-player (as opposed to 2-player) general-sum games. We describe an extension to existing criteria focusing explicitly on such setti...
Thuc Vu, Rob Powers, Yoav Shoham
ALGORITHMICA
2008
79views more  ALGORITHMICA 2008»
15 years 1 months ago
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kast...