563 search results - page 66 / 113 » Computing approximate PSD factorizations |
EMNLP
2009
13 years 7 months ago
2009
We study graphical modeling in the case of stringvalued random variables. Whereas a weighted finite-state transducer can model the probabilistic relationship between two strings, ...
MHCI
2009
Springer
14 years 4 months ago
2009
Springer
In our FoxHunt game, virtual foxes are chased on a playground. Foxes and hunters are rendered on a map displayed on GPS-enabled mobile phones. We collected data from three field ...
SOFSEM
2007
Springer
14 years 4 months ago
2007
Springer
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
TOC
2008
13 years 9 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
SIAMCOMP
2010
13 years 8 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...