Sciweavers

380 search results - page 12 / 76
» Mapping Problems with Finite-Domain Variables into Problems ...
Sort
View
IPL
2000
69views more  IPL 2000»
13 years 7 months ago
Generating all maximal models of a Boolean expression
We examine the computational problem of generating all maximal models of a Boolean expression in CNF. We give a resolution-like method that reduces the unnegated variables of an e...
Dimitris J. Kavvadias, Martha Sideri, Elias C. Sta...
IJCAI
2007
13 years 9 months ago
WiFi-SLAM Using Gaussian Process Latent Variable Models
WiFi localization, the task of determining the physical location of a mobile device from wireless signal strengths, has been shown to be an accurate method of indoor and outdoor l...
Brian Ferris, Dieter Fox, Neil D. Lawrence
SPEECH
1998
118views more  SPEECH 1998»
13 years 7 months ago
Dimensionality reduction of electropalatographic data using latent variable models
We consider the problem of obtaining a reduced dimension representation of electropalatographic (EPG) data. An unsupervised learning approach based on latent variable modelling is...
Miguel Á. Carreira-Perpiñán, ...
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 7 months ago
Synchronization recovery and state model reduction for soft decoding of variable length codes
Abstract-- Variable length codes (VLCs) exhibit desynchronization problems when transmitted over noisy channels. Trellis decoding techniques based on Maximum A Posteriori (MAP) est...
Simon Malinowski, Herve Jegou, Christine Guillemot
DATE
1999
IEEE
194views Hardware» more  DATE 1999»
13 years 11 months ago
Algorithms for Solving Boolean Satisfiability in Combinational Circuits
Boolean Satisfiability is a ubiquitous modeling tool in Electronic Design Automation, It finds application in test pattern generation, delay-fault testing, combinational equivalen...
Luís Guerra e Silva, Luis Miguel Silveira, ...