1326 search results - page 229 / 266 » Approximate Tree Kernels |
151
click to vote
ASIAMS
2007
IEEE
15 years 8 months ago
2007
IEEE
This talk has two parts explaining the significance of Rough sets in granular computing in terms of rough set rules and in uncertainty handling in terms of lower and upper approxi...
115
Voted
SIGECOM
2006
ACM
15 years 8 months ago
2006
ACM
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
125
click to vote
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
107
click to vote
STACS
2004
Springer
15 years 7 months ago
2004
Springer
OrthogonalVariableSpreadingFactor(OVSF)codesareusedinUMTStosharetheradiospectrum among several connections of possibly different bandwidth requirements. The combinatorial core of t...
113
click to vote
AAAI
2010
15 years 3 months ago
2010
Lifted inference, handling whole sets of indistinguishable objects together, is critical to the effective application of probabilistic relational models to realistic real world ta...