Sciweavers

1547 search results - page 43 / 310
» Solving Knapsack Problems in a Sticker Based Model
Sort
View
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 7 months ago
Model Selection Through Sparse Maximum Likelihood Estimation
We consider the problem of estimating the parameters of a Gaussian or binary distribution in such a way that the resulting undirected graphical model is sparse. Our approach is to...
Onureena Banerjee, Laurent El Ghaoui, Alexandre d'...
UC
2009
Springer
14 years 2 months ago
Resource-Competing Oscillator Network as a Model of Amoeba-Based Neurocomputer
Abstract. An amoeboid organism, Physarum, exhibits rich spatiotemporal oscillatory behavior and various computational capabilities. Previously, the authors created a recurrent neur...
Masashi Aono, Yoshito Hirata, Masahiko Hara, Kazuy...
ICIAP
2001
Springer
14 years 7 months ago
Global Optimization of Deformable Surface Meshes Based on Genetic Algorithms
Deformable models are by their formulation able to solve surface extraction problem from noisy volumetric image data encountered commonly in medical image analysis. However, this ...
Jussi Tohka
NAACL
2010
13 years 5 months ago
A Direct Syntax-Driven Reordering Model for Phrase-Based Machine Translation
This paper presents a direct word reordering model with novel syntax-based features for statistical machine translation. Reordering models address the problem of reordering source...
Niyu Ge
TACAS
2010
Springer
342views Algorithms» more  TACAS 2010»
14 years 2 months ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Janusz Malinowski, Peter Niebert