1920 search results - page 50 / 384 » The Complexity of the A B C Problem |
172
click to vote
WG
2001
Springer
15 years 10 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
136
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...
142
click to vote
CIKM
2007
Springer
16 years 4 days ago
2007
Springer
We study the parallelization of the (record) linkage problem – i.e., to identify matching records between two collections of records, A and B. One of main idiosyncrasies of the ...
175
click to vote
GRC
2010
IEEE
15 years 7 months ago
2010
IEEE
We present a problem of factor analysis of three-way binary data, i.e. data described by a 3-dimensional binary matrix I, describing a relationship between objects, attributes, an...
171
click to vote
FQAS
2000
Springer
15 years 9 months ago
2000
Springer
Frequent association rules (e.g., AB C to say that when properties A and B are true in a record then, C tends to be also true) have become a popular way to summarize huge datasets...