Sciweavers

14774 search results - page 2604 / 2955
» Computational complexity and evolutionary computation
Sort
View
DCG
1998
53views more  DCG 1998»
15 years 7 months ago
Motion Planning in Environments with Low Obstacle Density
We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...
A. Frank van der Stappen, Mark H. Overmars, Mark d...
GRAMMARS
1998
111views more  GRAMMARS 1998»
15 years 7 months ago
Quantitative Comparison of Languages
From the perspective of the linguist, the theory of formal languages serves as an abstract model to address issues such as complexity, learnability, information content, etc. which...
András Kornai
CGF
1999
137views more  CGF 1999»
15 years 7 months ago
Adaptive Acquisition of Lumigraphs from Synthetic Scenes
Light fields and Lumigraphs are capable of rendering scenes of arbitrary geometrical or illumination complexity in real time. They are thus interesting ways of interacting with bo...
Hartmut Schirmacher, Wolfgang Heidrich, Hans-Peter...
JBI
2002
126views Bioinformatics» more  JBI 2002»
15 years 7 months ago
Characteristic attributes in cancer microarrays
Rapid advances in genome sequencing and gene expression microarray technologies are providing unprecedented opportunities to identify specific genes involved in complex biological...
Indra Neil Sarkar, Paul J. Planet, T. E. Bael, S. ...
184
Voted
JACM
1998
88views more  JACM 1998»
15 years 7 months ago
A Threshold of ln n for Approximating Set Cover
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
Uriel Feige
« Prev « First page 2604 / 2955 Last » Next »