Sciweavers

29 search results - page 5 / 6
» Expanders are universal for the class of all spanning trees
Sort
View
GC
2008
Springer
13 years 6 months ago
Laplacian Spectrum of Weakly Quasi-threshold Graphs
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
R. B. Bapat, A. K. Lal, Sukanta Pati
EDBT
2008
ACM
137views Database» more  EDBT 2008»
14 years 6 months ago
Data exchange in the presence of arithmetic comparisons
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
Foto N. Afrati, Chen Li, Vassia Pavlaki
ATAL
2010
Springer
13 years 7 months ago
A quantified distributed constraint optimization problem
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
Toshihiro Matsui, Hiroshi Matsuo, Marius-Calin Sil...
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 29 days ago
Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards
In the classic multi-armed bandits problem, the goal is to have a policy for dynamically operating arms that each yield stochastic rewards with unknown means. The key metric of int...
Yi Gai, Bhaskar Krishnamachari, Rahul Jain
SIGUCCS
2004
ACM
13 years 11 months ago
Web-based technologies: reaching their ultimate potential on restricted budgets
Academic institutions’ dependence on web-based technologies to improve efficiency in class offerings, academic records, and office documentation is increasing at a rapid pace. T...
Salvador Báez-Franceschi, Karen Le, Diana V...