11213 search results - page 117 / 2243 » Low-contention data structures |
129
Voted
ICCV
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
121
click to vote
SDMW
2004
Springer
15 years 9 months ago
2004
Springer
With the increasing use of web services, many new challenges concerning data security are becoming critical. Data or applications can now be outsourced to powerful remote servers, ...
113
click to vote
IBERAMIA
2004
Springer
15 years 9 months ago
2004
Springer
We present a new branch and bound algorithm for Max-SAT which incorporates original lazy data structures, a new variable selection heuristics and a lower bound of better quality. W...
139
click to vote
VISUALIZATION
1992
IEEE
15 years 7 months ago
1992
IEEE
algorithms as networks of modules. The data flow architecture is popular because of the flexibility of mixing calculation modules with display modules, and because of its easy grap...
233
Voted
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
We introduce the Haar+ tree: a refined, wavelet-inspired data structure for synopsis construction. The advantages of this structure are twofold: First, it achieves higher synopsis...