Sciweavers

7129 search results - page 1015 / 1426
» Approximation Algorithms for Treewidth
Sort
View
ITA
2007
101views Communications» more  ITA 2007»
15 years 4 months ago
Learning tree languages from text
We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced by the author in Theoretical Computer Sc...
Henning Fernau
JCM
2007
79views more  JCM 2007»
15 years 4 months ago
Time Slot Assignment for Maximum Bandwidth in a Mobile Ad Hoc Network
—Time slot assignment is essential to provide the calculated bandwidth in a TDMA (Time Division Multiple Access)-based mobile ad hoc network (MANET), which is a focus of attentio...
Jianping Li, Yasushi Wakahara
TNN
2008
82views more  TNN 2008»
15 years 4 months ago
Deterministic Learning for Maximum-Likelihood Estimation Through Neural Networks
In this paper, a general method for the numerical solution of maximum-likelihood estimation (MLE) problems is presented; it adopts the deterministic learning (DL) approach to find ...
Cristiano Cervellera, Danilo Macciò, Marco ...
TVCG
2008
125views more  TVCG 2008»
15 years 4 months ago
Generic Remeshing of 3D Triangular Meshes with Metric-Dependent Discrete Voronoi Diagrams
In this paper, we propose a generic framework for 3D surface remeshing. Based on a metric-driven Discrete Voronoi Diagram construction, our output is an optimized 3D triangular mes...
Sébastien Valette, Jean-Marc Chassery, R&ea...
VC
2008
93views more  VC 2008»
15 years 4 months ago
Efficient product sampling using hierarchical thresholding
Abstract We present an efficient method for importance sampling the product of multiple functions. Our algorithm computes a quick approximation of the product on-the-fly, based on ...
Fabrice Rousselle, Petrik Clarberg, Luc Leblanc, V...
« Prev « First page 1015 / 1426 Last » Next »