Sciweavers

6740 search results - page 1087 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
ICALP
2007
Springer
16 years 25 days ago
Conservative Ambiguity Detection in Context-Free Grammars
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
Sylvain Schmitz
LION
2007
Springer
138views Optimization» more  LION 2007»
16 years 25 days ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Samuel Rota Bulò, Marcello Pelillo
PAKDD
2007
ACM
110views Data Mining» more  PAKDD 2007»
16 years 24 days ago
Combining Convolution Kernels Defined on Heterogeneous Sub-structures
Convolution kernels, constructed by convolution of sub-kernels defined on sub-structures of composite objects, are widely used in classification, where one important issue is to ch...
Minlie Huang, Xiaoyan Zhu
WADS
2007
Springer
101views Algorithms» more  WADS 2007»
16 years 24 days ago
Edges and Switches, Tunnels and Bridges
Abstract. Edge casing is a well-known method to improve the readability of drawings of non-planar graphs. A cased drawing orders the edges of each edge crossing and interrupts the ...
David Eppstein, Marc J. van Kreveld, Elena Mumford...
IROS
2006
IEEE
113views Robotics» more  IROS 2006»
16 years 21 days ago
A Framework for Automatic Deployment of Robots in 2D and 3D Environments
Abstract— We present a computational framework for automatic deployment of robots in 2D and 3D rectangular environments with polytopal obstacles. The results are derived for poly...
Marius Kloetzer, Calin Belta
« Prev « First page 1087 / 1348 Last » Next »