Sciweavers

1629 search results - page 283 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
CORR
2012
Springer
170views Education» more  CORR 2012»
13 years 5 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
MLG
2007
Springer
15 years 3 months ago
Weighted Substructure Mining for Image Analysis
1 In web-related applications of image categorization, it is desirable to derive an interpretable classification rule with high accuracy. Using the bag-of-words representation and...
Sebastian Nowozin, Koji Tsuda, Takeaki Uno, Taku K...
ICC
2008
IEEE
116views Communications» more  ICC 2008»
15 years 4 months ago
Intelligent Weather Aware Scheme for Satellite Systems
— Rain, snow, gaseous, cloud, fog, scintillation and other atmospheric properties can have a distorting effect on signal fidelity of Ku and Ka bands, thus resulting in excessive ...
Kamal Harb, Changcheng Huang, Anand Srinivasan, Br...
GLVLSI
2003
IEEE
146views VLSI» more  GLVLSI 2003»
15 years 3 months ago
A practical CAD technique for reducing power/ground noise in DSM circuits
One of the fundamental problems in Deep Sub Micron (DSM) circuits is Simultaneous Switching Noise (SSN), which causes voltage fluctuations in the circuit power/ground networks. In...
Arindam Mukherjee, Krishna Reddy Dusety, Rajsaktis...
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
15 years 10 months ago
Cleaning disguised missing data: a heuristic approach
In some applications such as filling in a customer information form on the web, some missing values may not be explicitly represented as such, but instead appear as potentially va...
Ming Hua, Jian Pei