Sciweavers

273 search results - page 53 / 55
» Can Pure Cutting Plane Algorithms Work
Sort
View
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
13 years 11 months ago
Optimal nesting of species for exact cover of resources: two against many
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
Jeffrey Horn
ESOP
2008
Springer
13 years 7 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong
TROB
2008
151views more  TROB 2008»
13 years 5 months ago
Inverse Depth Parametrization for Monocular SLAM
Recent work has shown that the probabilistic SLAM approach of explicit uncertainty propagation can succeed in permitting repeatable 3D real-time localization and mapping even in th...
Javier Civera, Andrew J. Davison, J. M. M. Montiel
NAACL
2010
13 years 3 months ago
Dialogue-Oriented Review Summary Generation for Spoken Dialogue Recommendation Systems
In this paper we present an opinion summarization technique in spoken dialogue systems. Opinion mining has been well studied for years, but very few have considered its applicatio...
Jingjing Liu, Stephanie Seneff, Victor Zue
VMV
2004
185views Visualization» more  VMV 2004»
13 years 6 months ago
Convexification of Unstructured Grids
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
Stefan Röttger, Stefan Guthe, Andreas Schiebe...