2200 search results - page 68 / 440 » Programming norm change |
CDES
2006
13 years 10 months ago
2006
Recently, several loop buffer designs have been proposed to reduce instruction fetch energy due to size and location advantage of loop buffer. Nevertheless, on design complexity di...
JMLR
2012
11 years 11 months ago
2012
Traditional tensor decompositions such as the CANDECOMP / PARAFAC (CP) and Tucker decompositions yield higher-order principal components that have been used to understand tensor d...
JMLR
2012
11 years 11 months 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...
SEMCO
2008
IEEE
14 years 3 months ago
2008
IEEE
The twin mainstream computing shifts of mobility and programable Web are fundamentally impacting how humans interact, socialize, and access information. Never before has computing...
POPL
2002
ACM
14 years 9 months ago
2002
ACM
We present a new role system in which the type (or role) of each object depends on its referencing relationships with other objects, with the role changing as these relationships ...