5022 search results - page 60 / 1005 » Data structures and problem solving using Java |
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
RECOMB
1998
Springer
15 years 2 months ago
1998
Springer
The task of computing molecular structure from combinations of experimental and theoretical constraints is expensive because of the large number of estimated parameters (the 3D co...
SCIA
2009
Springer
15 years 4 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
154
click to vote
ICDT
2009
ACM
15 years 10 months ago
2009
ACM
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
3DPVT
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper we address the problem of recovering structure and motion from a large number of intrinsically calibrated perspective cameras. We describe a method that combines (1)...