1984 search results - page 181 / 397 » The colourful feasibility problem |
160
click to vote
DCC
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper investigates compression of encrypted data. It has been previously shown that data encrypted with Vernam’s scheme [1], also known as the one-time pad, can be compress...
165
click to vote
ISBI
2009
IEEE
16 years 1 months ago
2009
IEEE
Image segmentation is an essential step in many image analysis pipelines and many algorithms have been proposed to solve this problem. However, they are often evaluated subjective...
164
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— Sampling-based motion planners are often used to solve very high-dimensional planning problems. Many recent algorithms use projections of the state space to estimate properties...
174
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We address the problem of real-time navigation in dynamic environments for car-like robots. Our approach generalizes the concept of velocity obstacles, which have been used for...
172
click to vote
ISORC
2009
IEEE
16 years 1 months ago
2009
IEEE
There is increasing convergence between the fields of parallel and embedded computing. The demand for more functionality in embedded devices means that complex multicore architec...