Sciweavers

137
Voted
CIAC
2006
Springer
97views Algorithms» more  CIAC 2006»
15 years 7 months ago
Network Discovery and Verification with Distance Queries
The network discovery (verification) problem asks for a minimum subset Q V of queries in an undirected graph G = (V, E) such that these queries discover all edges and non-edges o...
Thomas Erlebach, Alexander Hall, Michael Hoffmann ...
149
Voted
ECCV
2004
Springer
15 years 7 months ago
Geometric Structure of Degeneracy for Multi-body Motion Segmentation
Many techniques have been proposed for segmenting feature point trajectories tracked through a video sequence into independent motions. It has been found, however, that methods tha...
Yasuyuki Sugaya, Ken-ichi Kanatani
136
Voted
ECCV
2004
Springer
15 years 7 months ago
Extending Interrupted Feature Point Tracking for 3-D Affine Reconstruction
Feature point tracking over a video sequence fails when the points go out of the field of view or behind other objects. In this paper, we extend such interrupted tracking by imposi...
Yasuyuki Sugaya, Ken-ichi Kanatani
112
Voted
CIA
2006
Springer
15 years 7 months ago
Selecting Web Services Statistically
Abstract. Service oriented computing oers a new approach to programming. To be useful for large and diverse sets of problems, eective service selection and composition is crucial. ...
David Lambert, David Robertson
133
Voted
CIA
2006
Springer
15 years 7 months ago
Eliminating Interdependencies Between Issues for Multi-issue Negotiation
In multi-issue negotiations, issues may be negotiated independently or not. In the latter case, the utility associated with one issue depends on the value of another. These issue d...
Koen V. Hindriks, Catholijn M. Jonker, Dmytro Tykh...