Sciweavers

1144 search results - page 170 / 229
» Fractal Algorithm for Finding Global Optimal Solution
Sort
View
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
15 years 7 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
ACL
2006
14 years 11 months ago
Discriminative Word Alignment with Conditional Random Fields
In this paper we present a novel approach for inducing word alignments from sentence aligned data. We use a Conditional Random Field (CRF), a discriminative model, which is estima...
Phil Blunsom, Trevor Cohn
INFOCOM
2010
IEEE
14 years 8 months ago
Energy-Conserving Scheduling in Multi-hop Wireless Networks with Time-Varying Channels
Abstract— MaxWeight algorithm, a.k.a., back-pressure algorithm, has received much attention as a viable solution for dynamic link scheduling in multi-hop wireless networks. The b...
Yang Song, Chi Zhang, Yuguang Fang, Zhisheng Niu
IJDMBC
2010
115views more  IJDMBC 2010»
14 years 4 months ago
Near Optimum Power Control and Precoding under Fairness Constraints in Network MIMO Systems
Abstract--We consider the problem of setting the uplink signalto-noise-and-interference (SINR) target and allocating transmit powers for mobile stations in multicell spatial multip...
Gábor Fodor, Mikael Johansson, Pablo Soldat...
ICASSP
2010
IEEE
14 years 10 months ago
Distributed Lasso for in-network linear regression
The least-absolute shrinkage and selection operator (Lasso) is a popular tool for joint estimation and continuous variable selection, especially well-suited for the under-determin...
Juan Andrés Bazerque, Gonzalo Mateos, Georg...