Sciweavers

397 search results - page 60 / 80
» Towards Polynomial Lower Bounds for Dynamic Problems
Sort
View
COLT
2010
Springer
15 years 2 months ago
Active Learning on Trees and Graphs
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
QEST
2008
IEEE
15 years 10 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...
ICC
2009
IEEE
144views Communications» more  ICC 2009»
15 years 2 months ago
Green DSL: Energy-Efficient DSM
Dynamic spectrum management (DSM) has been recognized as a key technology for tackling multi-user crosstalk interference for DSL broadband access. Up to now, DSM design has mainly ...
Paschalis Tsiaflakis, Yung Yi, Mung Chiang, Marc M...
COMPGEOM
2007
ACM
15 years 8 months ago
Guard placement for efficient point-in-polygon proofs
We consider the problem of placing a small number of angle guards inside a simple polygon P so as to provide efficient proofs that any given point is inside P. Each angle guard vi...
David Eppstein, Michael T. Goodrich, Nodari Sitchi...
JCP
2007
102views more  JCP 2007»
15 years 4 months ago
Deterministic Models of an Active Magnetic Bearing System
— In this paper the development of mathematical model of voltage-input and current-input active magnetic bearing (AMB) system in deterministic form is presented. The AMB system, ...
Abdul Rashid Husain, Mohamad Noh Ahmad, Abdul Hali...