417 search results - page 55 / 84 » Some Theory for Generalized Boosting Algorithms |
LCTRTS
2009
Springer
14 years 3 months ago
2009
Springer
Register allocation is often a two-phase approach: spilling of registers to memory, followed by coalescing of registers. Extreme liverange splitting (i.e. live-range splitting aft...
COMPGEOM
2006
ACM
14 years 3 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
WWW
2009
ACM
14 years 9 months ago
2009
ACM
Giving suggestions to users of Web-based services is a common practice aimed at enhancing their navigation experience. Major Web Search Engines usually provide Suggestions under t...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
STOC
2007
ACM
14 years 9 months ago
2007
ACM
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....