Sciweavers

9842 search results - page 357 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
CRV
2009
IEEE
115views Robotics» more  CRV 2009»
15 years 11 months ago
Learning Model Complexity in an Online Environment
In this paper we introduce the concept and method for adaptively tuning the model complexity in an online manner as more examples become available. Challenging classification pro...
Dan Levi, Shimon Ullman
LICS
2008
IEEE
15 years 10 months ago
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
Søren Riis
DNIS
2005
Springer
112views Database» more  DNIS 2005»
15 years 9 months ago
Modelling Peer-to-Peer Data Networks Under Complex System Theory
: A Peer-to-peer Data Network (PDN) is an open and evolving society of peer nodes that assemble into a network to share their data for mutual benefit. PDNs are enabled by distribu...
Cyrus Shahabi, Farnoush Banaei Kashani
MOBIHOC
2009
ACM
16 years 4 months ago
Delay and effective throughput of wireless scheduling in heavy traffic regimes: vacation model for complexity
Distributed scheduling algorithms for wireless ad hoc networks have received substantial attention over the last decade. The complexity levels of these algorithms span a wide spec...
Yung Yi, Junshan Zhang, Mung Chiang
GLOBECOM
2007
IEEE
15 years 10 months ago
Low PAPR STBCs from Complex Partial-Orthogonal Designs (CPODs)
— Space-time codes from complex orthogonal designs (CODs) with no zero entries offer low Peak to Average power ratio (PAPR) and avoid the problem of turning off antennas. But COD...
Gopu V. R. Muni Kumar, B. Sundar Rajan