Sciweavers

1150 search results - page 171 / 230
» Note from the Editor
Sort
View
ECAI
2010
Springer
13 years 8 months ago
Variable Level-Of-Detail Motion Planning in Environments with Poorly Predictable Bodies
Motion planning in dynamic environments consists of the generation of a collision-free trajectory from an initial to a goal state. When the environment contains uncertainty, preven...
Stefan Zickler, Manuela M. Veloso
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 7 months ago
Probing Capacity
We consider the problem of optimal probing of states of a channel by transmitter and receiver for maximizing rate of reliable communication. The channel is discrete memoryless (DM...
Himanshu Asnani, Haim H. Permuter, Tsachy Weissman
DAM
2010
103views more  DAM 2010»
13 years 7 months ago
Dynamic list coloring of bipartite graphs
A dynamic coloring of a graph is a proper coloring of its vertices such that every vertex of degree more than one has at least two neighbors with distinct colors. The least number...
Louis Esperet
DCG
2008
76views more  DCG 2008»
13 years 7 months ago
Asymmetry of Convex Polytopes and Vertex Index of Symmetric Convex Bodies
In [GL] it was shown that a polytope with few vertices is far from being symmetric in the Banach-Mazur distance. More precisely, it was shown that Banach-Mazur distance between su...
E. D. Gluskin, A. E. Litvak
AAECC
2006
Springer
132views Algorithms» more  AAECC 2006»
13 years 7 months ago
The Conjugacy Search Problem in Public Key Cryptography: Unnecessary and Insufficient
The conjugacy search problem in a group G is the problem of recovering an x G from given g G and h = x-1 gx. This problem is in the core of several recently suggested public key ...
Vladimir Shpilrain, Alexander Ushakov