4266 search results - page 466 / 854 » The container loading problem |
183
click to vote
FAST
2009
15 years 2 months ago
2009
The notion of RDF Named Graphs has been proposed in order to assign provenance information to data described using RDF triples. In this paper, we argue that named graphs alone can...
149
click to vote
IGARSS
2009
15 years 2 months ago
2009
Most available methods for endmember extraction use the convexity of the data structure and consider the vertices of the data as the purest pixels. Such methods do not consider th...
191
click to vote
DMTCS
2010
15 years 2 months ago
2010
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
161
click to vote
ALGORITHMICA
2011
15 years 5 days ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
166
click to vote
ACCV
2010
Springer
15 years 5 days ago
2010
Springer
Accurate localization of the salient object from an image is a difficult problem when the saliency map is noisy and incomplete. A fast approach to detect salient objects from image...