635 search results - page 49 / 127 » Some Computational Problems Related to Pseudo-intents |
104
Voted
ACRI
2010
Springer
14 years 8 months ago
2010
Springer
In this work we study the complexity of the three-dimensional sandpile avalanches triggered by the addition of two critical configurations. We prove that the algorithmic problem c...
SLE
2009
Springer
15 years 4 months ago
2009
Springer
One of the most ubiquitous elements of modern computing is the relational database. Very few modern applications are created without some sort of database backend. Unfortunately, r...
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
AAECC
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. After some excitement generated by recently suggested public key exchange protocols due to Anshel-Anshel-Goldfeld and Ko-Lee et al., it is a prevalent opinion now that th...
IOR
2010
14 years 8 months ago
2010
In many applications involving make-to-order or time-sensitive (e.g., perishable, seasonal) products, finished orders are often delivered to customers immediately or shortly after...