Sciweavers

218 search results - page 14 / 44
» A Theory of Mean Field Approximation
Sort
View
EUROCAST
2005
Springer
102views Hardware» more  EUROCAST 2005»
15 years 3 months ago
Approximation Problems Categories
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
Liara Aparecida dos Santos Leal, Dalcidio Moraes C...
DAC
2009
ACM
15 years 11 months ago
Human computing for EDA
Electronic design automation is a field replete with challenging ? and often intractable ? problems to be solved over very large instances. As a result, the field of design automa...
Andrew DeOrio, Valeria Bertacco
TCOM
2008
66views more  TCOM 2008»
14 years 10 months ago
Lattice codes for amplified direct-detection optical systems
Theories of shaping for lattice codes have been developed for systems (optical or non-optical) using coherent detection with additive white Gaussian noise (AWGN) and for direct-det...
Wei Mao, Joseph M. Kahn
114
Voted
PODS
2007
ACM
203views Database» more  PODS 2007»
15 years 10 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
CORR
2004
Springer
133views Education» more  CORR 2004»
14 years 10 months ago
Information theory, multivariate dependence, and genetic network inference
We define the concept of dependence among multiple variables using maximum entropy techniques and introduce a graphical notation to denote the dependencies. Direct inference of in...
Ilya Nemenman