19320 search results - page 262 / 3864 » On the complexity of computing determinants |
303
click to vote
LACL
2011
Springer
14 years 9 months ago
2011
Springer
The problem of generating referring expressions (GRE) is an important task in natural language generation. In this paper, we advocate for the use of logical languages in the output...
176
click to vote
COCOON
2007
Springer
16 years 25 days ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
172
click to vote
EUROCRYPT
2007
Springer
15 years 10 months ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
203
click to vote
SIGGRAPH
1997
ACM
15 years 10 months ago
1997
ACM
Simulating realistic lighting and rendering complex scenes are usually considered separate problems with incompatible solutions. Accurate lighting calculations are typically perfo...
159
click to vote
LICS
1999
IEEE
15 years 11 months ago
1999
IEEE
We present some new decision and comparison problems of unusually high computational complexity. Most of the problems are strictly combinatorial in nature; others involve basic lo...