Sciweavers

9842 search results - page 1290 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
ICMCS
2005
IEEE
97views Multimedia» more  ICMCS 2005»
16 years 1 months ago
A computationally efficient 3D shape rejection algorithm
In this paper, we present an efficient 3D shape rejection algorithm for unlabeled 3D markers. The problem is important in domains such as rehabilitation and the performing arts. T...
Yinpeng Chen, Hari Sundaram
ICMCS
2005
IEEE
110views Multimedia» more  ICMCS 2005»
16 years 1 months ago
Learned color constancy from local correspondences
The ability of humans for color constancy, i.e. the ability to correct for color deviation caused by a different illumination, is far beyond computer vision performances: nowadays...
Tijmen Moerland, Frédéric Jurie
ICRA
2005
IEEE
121views Robotics» more  ICRA 2005»
16 years 1 months ago
Distributed Sampling-Based Roadmap of Trees for Large-Scale Motion Planning
Abstract— High-dimensional problems arising from complex robotic systems test the limits of current motion planners and require the development of efficient distributed motion p...
Erion Plaku, Lydia E. Kavraki
LCN
2005
IEEE
16 years 1 months ago
Secure Content Delivery using Key Composition
In this paper, we propose a novel framework for secure multicast on overlay networks. Our contributions are threefold: 1) a technique key composition is proposed to cope with the ...
Chun-Ying Huang, Yun-Peng Chiu, Kuan-Ta Chen, Hann...
AMOST
2005
ACM
16 years 1 months ago
Using information about functions in selecting test cases
We consider the problem of generating a set of test cases from a black box specification. We focus on stress testing, i.e. picking test cases that seem most likely to reveal prog...
Markus Clermont, David Lorge Parnas
« Prev « First page 1290 / 1969 Last » Next »