6202 search results - page 34 / 1241 » Without Loss of Generality |
KDD
2006
ACM
15 years 10 months ago
2006
ACM
Often the best performing supervised learning models are ensembles of hundreds or thousands of base-level classifiers. Unfortunately, the space required to store this many classif...
127
click to vote
JMLR
2012
13 years 12 days ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
128
click to vote
SIGCOMM
2004
ACM
15 years 3 months ago
2004
ACM
Overlay network monitoring enables distributed Internet applications to detect and recover from path outages and periods of degraded performance within seconds. For an overlay net...
ENTCS
2006
14 years 10 months ago
2006
It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-control...
ASPDAC
2005
ACM
14 years 12 months ago
2005
ACM
Abstract— ACG (Adjacent Constraint Graph) is a general floorplan representation. The refinement of constraint graphs gives not only an efficient representation but also a repre...