Sciweavers

4047 search results - page 689 / 810
» Some Properties and Some Problems on Set Functors
Sort
View
ICML
2008
IEEE
16 years 5 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
SDM
2009
SIAM
154views Data Mining» more  SDM 2009»
16 years 1 months ago
AMORI: A Metric-Based One Rule Inducer.
The requirements of real-world data mining problems vary extensively. It is plausible to assume that some of these requirements can be expressed as application-specific performan...
Niklas Lavesson, Paul Davidsson
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
15 years 11 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
CISS
2008
IEEE
15 years 11 months ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
Shirin Jalali, Tsachy Weissman
AINA
2007
IEEE
15 years 11 months ago
On the Miscollaboration of Congestion Control Mechanisms at the Transport and the Network Layers
Many sophisticated mechanisms have been implemented at both the transport and the network layers in order to estimate network conditions and avoid overload of network links. We ev...
Ageliki Tsioliaridou, Christos V. Samaras, Vassili...