5606 search results - page 110 / 1122 » Randomization Techniques for Graphs. |
WALCOM
2010
IEEE
14 years 5 months ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
ICRA
2000
IEEE
14 years 2 months ago
2000
IEEE
This paper presents a randomized motion planner for kinodynamic asteroidavoidanceproblems, in which a robot must avoid collision with moving obstacles under kinematic, dynamic con...
ICCAD
1998
IEEE
14 years 2 months ago
1998
IEEE
We lay out a theoretical framework to evaluate watermarking techniques for intellectual property protection (IPP). Based on this framework, we analyze two watermarking techniques ...
CADE
2001
Springer
14 years 2 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
ISNN
2005
Springer
14 years 3 months ago
2005
Springer
The Self-Organizing Map is a popular neural network model for data analysis, for which a wide variety of visualization techniques exists. We present a novel technique that takes th...