Sciweavers

3415 search results - page 521 / 683
» Lower Bounds for Kernelizations
Sort
View
ICDCS
2009
IEEE
16 years 1 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir
ALT
2009
Springer
16 years 1 months ago
Learning Finite Automata Using Label Queries
We consider the problem of learning a finite automaton M of n states with input alphabet X and output alphabet Y when a teacher has helpfully or randomly labeled the states of M u...
Dana Angluin, Leonor Becerra-Bonache, Adrian Horia...
ALT
2008
Springer
16 years 1 months ago
Optimally Learning Social Networks with Activations and Suppressions
In this paper we consider the problem of learning hidden independent cascade social networks using exact value injection queries. These queries involve activating and suppressing a...
Dana Angluin, James Aspnes, Lev Reyzin
ALT
2002
Springer
16 years 1 months ago
Optimally-Smooth Adaptive Boosting and Application to Agnostic Learning
We describe a new boosting algorithm that is the first such algorithm to be both smooth and adaptive. These two features make possible performance improvements for many learning ...
Dmitry Gavinsky
ICCAD
2003
IEEE
158views Hardware» more  ICCAD 2003»
16 years 1 months ago
Approaching the Maximum Energy Saving on Embedded Systems with Multiple Voltages
Dynamic voltage scaling (DVS) is arguably the most effective energy reduction technique. The multiple-voltage DVS systems, which can operate only at pre-determined discrete voltag...
Shaoxiong Hua, Gang Qu