11991 search results - page 165 / 2399 » Data Structure Fusion |
131
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...
124
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, ...
171
click to vote
ECBS
2010
IEEE
15 years 2 months ago
2010
IEEE
In classical data warehouses (DWH), classification of values takes place in a sharp manner, because of this true values cannot be measured and smooth transition between classes do...
114
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...
110
click to vote
JOSS
2000
15 years 3 months ago
2000
: Data structures comprising many binary variables can be represented graphically in various ways. Depending on the purpose different plots might be useful. Here two ways of showin...