681 search results - page 30 / 137 » General Polynomial Time Decomposition Algorithms |
125
Voted
PCI
2005
Springer
15 years 8 months ago
2005
Springer
The increasing popularity of all-optical networks has led to extensive research on the routing and wavelength assignment problem, also termed as the Routing and Path Coloring probl...
109
click to vote
ECAI
2008
Springer
15 years 4 months ago
2008
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tracta...
130
Voted
ICA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. The recovery of the mixture of an N-dimensional signal generated by N independent processes is a well studied problem (see e.g. [1,10]) and robust algorithms that solve t...
219
Voted
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
161
Voted
SDM
2011
SIAM
14 years 5 months ago
2011
SIAM
A binary matrix is fully nested if its columns form a chain of subsets; that is, any two columns are ordered by the subset relation, where we view each column as a subset of the r...