Sciweavers

429 search results - page 14 / 86
» Solving the Maximum Clique Problem Using PUBB
Sort
View
JMLR
2010
144views more  JMLR 2010»
13 years 2 months ago
Maximum Margin Learning with Incomplete Data: Learning Networks instead of Tables
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
Sándor Szedmák, Yizhao Ni, Steve R. ...
SWAT
1994
Springer
117views Algorithms» more  SWAT 1994»
13 years 11 months ago
Improved Approximations of Independent Sets in Bounded-Degree Graphs
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
Magnús M. Halldórsson, Jaikumar Radh...
VLSID
2002
IEEE
107views VLSI» more  VLSID 2002»
14 years 8 months ago
Estimation of Maximum Power-Up Current
Power gating is emerging as a viable solution to reduction of leakage current. However, power gated circuits are different from the conventional designs in the sense that a power-...
Fei Li, Lei He, Kewal K. Saluja
ADHOCNOW
2004
Springer
14 years 1 months ago
Approximating the Minimum Number of Maximum Power Users in Ad Hoc Networks
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
Errol L. Lloyd, Rui Liu, S. S. Ravi
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'...