Sciweavers

450 search results - page 32 / 90
» Satisfiability with Exponential Families
Sort
View
COCO
2008
Springer
129views Algorithms» more  COCO 2008»
15 years 1 months ago
Constraint Logic: A Uniform Framework for Modeling Computation as Games
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
Erik D. Demaine, Robert A. Hearn
TON
2010
126views more  TON 2010»
14 years 6 months ago
MAC Scheduling With Low Overheads by Learning Neighborhood Contention Patterns
Aggregate traffic loads and topology in multi-hop wireless networks may vary slowly, permitting MAC protocols to `learn' how to spatially coordinate and adapt contention patte...
Yung Yi, Gustavo de Veciana, Sanjay Shakkottai
SODA
2008
ACM
88views Algorithms» more  SODA 2008»
15 years 1 months ago
Sampling stable marriages: why spouse-swapping won't work
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model,&...
Nayantara Bhatnagar, Sam Greenberg, Dana Randall
KDD
2005
ACM
112views Data Mining» more  KDD 2005»
16 years 7 days ago
Model-based overlapping clustering
While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to finding overlapping clusters...
Arindam Banerjee, Chase Krumpelman, Joydeep Ghosh,...
TIT
2008
86views more  TIT 2008»
14 years 11 months ago
Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs
Let P = {p(i)} be a measure of strictly positive probabilities on the set of nonnegative integers. Although the countable number of inputs prevents usage of the Huffman algorithm, ...
Michael B. Baer