234 search results - page 30 / 47 » Rademacher Margin Complexity |
CONEXT
2008
ACM
15 years 3 months ago
2008
ACM
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
118
click to vote
KDD
2006
ACM
16 years 1 months ago
2006
ACM
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
124
click to vote
IPSN
2005
Springer
15 years 7 months ago
2005
Springer
Tracking the identities of moving objects is an important aspect of most multi-object tracking applications. Uncertainty in sensor data, coupled with the intrinsic difficulty of ...
133
click to vote
JMLR
2008
15 years 1 months ago
2008
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
116
click to vote
CN
2004
15 years 1 months ago
2004
This paper proposes a traffic model and a parameter fitting procedure that are capable of achieving accurate prediction of the queuing behavior for IP traffic exhibiting long-rang...