2254 search results - page 175 / 451 » Computing the minimal covering set |
200
click to vote
PAKDD
2004
ACM
15 years 12 months ago
2004
ACM
Inductive queries are queries to an inductive database that generate a set of patterns in a data mining context. Inductive querying poses new challenges to database and data mining...
146
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
We propose a competitive finite mixture of neurons (or perceptrons) for solving binary classification problems. Our classifier includes a prior for the weights between different n...
158
click to vote
CHI
2008
ACM
16 years 7 months ago
2008
ACM
Most video games require constant interaction, so game designers must pay careful attention to usability issues. However, there are few formal methods for evaluating the usability...
182
click to vote
DCC
2006
IEEE
16 years 6 months ago
2006
IEEE
An uncovering-by-bases for a group G acting on a finite set is a set U of bases for G such that any r-subset of is disjoint from at least one base in U, where r is a parameter d...
159
click to vote
SEMCO
2007
IEEE
16 years 27 days ago
2007
IEEE
Most research in the field of anaphora or coreference detection has been limited to noun phrase coreference, usually on a restricted set of entities, such as ACE entities. In par...