Sciweavers

211 search results - page 36 / 43
» Counting the number of independent sets in chordal graphs
Sort
View
SIGECOM
2006
ACM
106views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Approximation algorithms and online mechanisms for item pricing
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
Maria-Florina Balcan, Avrim Blum
NETWORKS
2007
13 years 7 months ago
Vertex disjoint routings of cycles over tori
We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consi...
Jean-Claude Bermond, Min-Li Yu
TSP
2010
13 years 2 months ago
Learning Gaussian tree models: analysis of error exponents and extremal structures
The problem of learning tree-structured Gaussian graphical models from independent and identically distributed (i.i.d.) samples is considered. The influence of the tree structure a...
Vincent Y. F. Tan, Animashree Anandkumar, Alan S. ...
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
13 years 7 months ago
Pattern Avoidance in Permutations: Linear and Cyclic Orders
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
Antoine Vella
SADM
2011
13 years 2 months ago
Trellis display for modeling data from designed experiments
Abstract: Visualizing data by graphing a response against certain factors, and conditioning on other factors, has arisen independently in many contexts. One is the interaction plot...
Montserrat Fuentes, Bowei Xi, William S. Cleveland