14165 search results - page 163 / 2833 » The generalized two-server problem |
122
click to vote
ICONIP
2007
15 years 5 months ago
2007
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
139
click to vote
IUI
2009
ACM
16 years 28 days ago
2009
ACM
Selection tasks are common in modern computer interfaces: we are often required to select a set of files, emails, data entries, and the like. File and data browsers have sorting a...
121
click to vote
GBRPR
2007
Springer
15 years 8 months ago
2007
Springer
We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by it...
131
click to vote
ICDT
2010
ACM
15 years 3 months ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
143
click to vote
ICFP
2005
ACM
16 years 4 months ago
2005
ACM
Implementing first-class continuations can pose a challenge if the target machine makes no provisions for accessing and re-installing the run-time stack. In this paper, we present...