14386 search results - page 189 / 2878 » The Chinese Generals Problem |
117
click to vote
CIKM
2009
Springer
15 years 10 months ago
2009
Springer
We propose a General Markov Framework for computing page importance. Under the framework, a Markov Skeleton Process is used to model the random walk conducted by the web surfer on...
120
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...
138
Voted
IUI
2009
ACM
16 years 22 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...
120
click to vote
GBRPR
2007
Springer
15 years 7 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...
128
click to vote
ICDT
2010
ACM
15 years 2 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...