34170 search results - page 6580 / 6834 » Optimization |
113
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Let O = {O1, . . . , Om} be a set of m convex polygons in R2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without refle...
137
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
156
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
149
click to vote
ESWS
2008
Springer
15 years 5 months ago
2008
Springer
In this contribution a system is presented, which provides access to distributed data sources using Semantic Web technology. While it was primarily designed for data sharing and sc...
165
click to vote
ICCV
2007
IEEE
15 years 5 months ago
2007
IEEE
Our goal is to create a visual odometry system for robots and wearable systems such that localization accuracies of centimeters can be obtained for hundreds of meters of distance ...