125 search results - page 11 / 25 » N Semantic Classes are Harder than Two |
112
click to vote
DATAMINE
1999
14 years 9 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
ICCBR
2003
Springer
15 years 2 months ago
2003
Springer
In the CBR literature from the past 25 years there is a considerable amount of research work that makes use of cases that are subspaces of some representation space rather than poi...
165
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...
BMCBI
2010
14 years 9 months ago
2010
Background: Systematic reviews address a specific clinical question by unbiasedly assessing and analyzing the pertinent literature. Citation screening is a time-consuming and crit...
88
Voted
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...