Sciweavers

2490 search results - page 226 / 498
» The Generalized Theory of Model Preference
Sort
View
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
16 years 1 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
ENTCS
2006
125views more  ENTCS 2006»
15 years 6 months ago
Monads and Adjunctions for Global Exceptions
In this paper, we look at two categorical accounts of computational effects (strong monad as a model of the monadic metalanguage, adjunction as a model of call-bypush-value with s...
Paul Blain Levy
PR
2006
88views more  PR 2006»
15 years 6 months ago
Directional features in online handwriting recognition
The selection of valuable features is crucial in pattern recognition. In this paper we deal with the issue that part of features originate from directional instead of common linea...
Claus Bahlmann
INFOCOM
2010
IEEE
15 years 5 months ago
Distributed Algorithms for Approximating Wireless Network Capacity
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
Michael Dinitz
BMCBI
2005
106views more  BMCBI 2005»
15 years 6 months ago
SIMPROT: Using an empirically determined indel distribution in simulations of protein evolution
Background: General protein evolution models help determine the baseline expectations for the evolution of sequences, and they have been extensively useful in sequence analysis an...
Andy Pang, Andrew D. Smith, Paulo A. S. Nuin, Elis...