556 search results - page 50 / 112 » A Comparative Study of Some Generalized Rough Approximations |
118
click to vote
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
148
Voted
ICASSP
2009
IEEE
14 years 11 months ago
2009
IEEE
Nonnegative matrix factorization (NMF) is a widely-used method for low-rank approximation (LRA) of a nonnegative matrix (matrix with only nonnegative entries), where nonnegativity...
301
Voted
COCOON
2011
Springer
14 years 1 months ago
2011
Springer
Motivated by a security problem in geographic information systems, we study the following graph theoretical problem: given a graph G, two special nodes s and t in G, and a number k...
93
Voted
EDBTW
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We discuss, compare and relate some old and some new models for incomplete and probabilistic databases. We characterize the expressive power of c-tables over infinite dom...
103
Voted
IJCAI
1993
15 years 3 months ago
1993
Traditional algorithms for prime implicate generation [Quine, 1952; McCluskey, 1956; Tison, 1967; Kean and Tsiknis, 1990; de Kleer, 1992] require the input formulas to be first tr...