379 search results - page 33 / 76 » The Graham-Knowlton Problem Revisited |
125
click to vote
STACS
2009
Springer
15 years 10 months ago
2009
Springer
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
133
Voted
ICC
2009
IEEE
15 years 10 months ago
2009
IEEE
—We consider multi-resolution storage, a technique for providing scalable adaptive data fidelity, necessary for many applications of large wireless sensor networks (WSNs). Altho...
113
click to vote
IRI
2008
IEEE
15 years 10 months ago
2008
IEEE
— We revisit the problem of synthesis of service composition in the context of service oriented architecture from a tree automata perspective. Comparing to existing finite state...
122
click to vote
DLOG
2010
15 years 1 months ago
2010
In this paper, we revisit the problem of definitorial completeness, i.e., whether a given general TBox T in a description logic (DL) L can be rewritten to an acyclic TBox T in L . ...
146
click to vote
JMLR
2010
14 years 10 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...