Sciweavers

393 search results - page 20 / 79
» The LCA Problem Revisited
Sort
View
EJC
2008
15 years 1 months ago
Some existence and construction results of polygonal designs
This paper revisits the existence and construction problems for polygonal designs (a special class of partially balanced incomplete block designs associated with regular polygons)...
Gargi Bhattacharyya, John Hegeman, Joohyung Kim, J...
92
Voted
DCG
2007
104views more  DCG 2007»
15 years 1 months ago
Coincidence Site Modules in 3-Space
The coincidence site lattice (CSL) problem and its generalization to Z-modules in Euclidean 3-space is revisited, and various results and conjectures are proved in a unified way, ...
Michael Baake, Peter A. B. Pleasants, Ulf Rehmann
ICGI
2010
Springer
15 years 12 days ago
Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us
Abstract. This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessmen...
Sophia Katrenko, Menno van Zaanen
111
Voted
CDC
2010
IEEE
103views Control Systems» more  CDC 2010»
14 years 9 months ago
Integrator forwarding via dynamic scaling
The problem of integrator forwarding is revisited using the notion of dynamically scaled (control) Lyapunov function. A new class of dynamic stabilizing control laws is presented, ...
Laurent Praly, Daniele Carnevale, Alessandro Astol...
SIAMDM
2010
101views more  SIAMDM 2010»
14 years 8 months ago
Vision-Based Pursuit-Evasion in a Grid
We revisit the problem of pursuit-evasion in a grid introduced by Sugihara and Suzuki in the lineof-sight vision model. Consider an arbitrary evader Z with the maximum speed of 1 ...
Adrian Dumitrescu, Howi Kok, Ichiro Suzuki, Pawel ...