1538 search results - page 108 / 308 » Relative Randomness and Cardinality |
IJAC
2002
14 years 9 months ago
2002
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
101
click to vote
TCS
2010
14 years 8 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
103
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
This work presents a distributed method for control centers in a power network to estimate the operating condition of the power plant, and to ultimately determine the occurrence o...
137
click to vote
JMLR
2011
14 years 4 months ago
2011
A widely agreed upon definition of time series causality inference, established in the seminal 1969 article of Clive Granger (1969), is based on the relative ability of the histor...
100
click to vote
PVLDB
2010
14 years 4 months ago
2010
Top-k queries are widely applied for retrieving a ranked set of the k most interesting objects based on the individual user preferences. As an example, in online marketplaces, cus...