Sciweavers

357 search results - page 51 / 72
» Fast Hypergraph Partition
Sort
View
91
Voted
NIPS
2000
15 years 3 months ago
Second Order Approximations for Probability Models
In this paper, we derive a second order mean field theory for directed graphical probability models. By using an information theoretic argument it is shown how this can be done in...
Hilbert J. Kappen, Wim Wiegerinck
109
Voted
ANOR
2008
93views more  ANOR 2008»
15 years 2 months ago
Pruning in column generation for service vehicle dispatching
Abstract Column generation techniques have become a widely used technique to successfully solve large (integer) linear programs. One of the keys to obtaining a practically efficien...
Stephan Westphal, Sven Oliver Krumke
TCOM
2008
81views more  TCOM 2008»
15 years 2 months ago
Optimum Power Allocation for Multiuser OFDM with Arbitrary Signal Constellations
This paper formulates power allocation policies that maximize the region of mutual informations achievable in multiuser downlink OFDM channels. Arbitrary partitioning of the availa...
Angel Lozano, Antonia Maria Tulino, S. Verdii
114
Voted
ISPDC
2010
IEEE
15 years 3 days ago
A Distributed Wakening Based Target Tracking Protocol for Wireless Sensor Networks
We propose a two layer protocol for tracking fast targets in sensor networks. At the lower layer, the Distributed Spanning Tree Algorithm (DSTA) [12] partitions the network into c...
Aysegul Alaybeyoglu, Orhan Dagdeviren, Aylin Kanta...
130
Voted
EACL
2009
ACL Anthology
15 years 7 hour ago
Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
Manfred Klenner, Étienne Ailloud