167 search results - page 21 / 34 » A class of polynomially solvable linear complementarity prob... |
117
click to vote
PODS
2007
ACM
16 years 15 days ago
2007
ACM
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
107
click to vote
CRYPTO
2001
Springer
15 years 4 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
95
Voted
SIGECOM
2003
ACM
15 years 5 months ago
2003
ACM
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
80
Voted
CDB
1997
Springer
15 years 4 months ago
1997
Springer
We consider two-dimensional spatial databases defined in terms of polynomial inequalities and investigate the expressibility of the topological connectivity query for these databa...
106
click to vote
SETA
2004
Springer
15 years 5 months ago
2004
Springer
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...