Sciweavers

205 search results - page 32 / 41
» When Can Limited Randomness Be Used in Repeated Games
Sort
View
BMCBI
2006
85views more  BMCBI 2006»
13 years 8 months ago
Searching for interpretable rules for disease mutations: a simulated annealing bump hunting strategy
Background: Understanding how amino acid substitutions affect protein functions is critical for the study of proteins and their implications in diseases. Although methods have bee...
Rui Jiang, Hua Yang, Fengzhu Sun, Ting Chen
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
14 years 23 days ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
ICASSP
2008
IEEE
14 years 3 months ago
A GIS-like training algorithm for log-linear models with hidden variables
Conditional Random Fields (CRFs) are often estimated using an entropy based criterion in combination with Generalized Iterative Scaling (GIS). GIS offers, upon others, the immedi...
Georg Heigold, Thomas Deselaers, Ralf Schlüte...
IPSN
2003
Springer
14 years 1 months ago
Organizing a Global Coordinate System from Local Information on an Ad Hoc Sensor Network
Abstract. We demonstrate that it is possible to achieve accurate localization and tracking of a target in a randomly placed wireless sensor network composed of inexpensive componen...
Radhika Nagpal, Howard E. Shrobe, Jonathan Bachrac...
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
14 years 1 months ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm