Sciweavers

973 search results - page 115 / 195
» New Bounds on Crossing Numbers
Sort
View
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 6 months ago
High-SIR Transmission Capacity of Wireless Networks with General Fading and Node Distribution
In many wireless systems, interference is the main performance-limiting factor, and is primarily dictated by the locations of concurrent transmitters. In many earlier works, the l...
Radha Krishna Ganti, Jeffrey G. Andrews, Martin Ha...
JACM
2008
90views more  JACM 2008»
15 years 6 months ago
Bit complexity of breaking and achieving symmetry in chains and rings
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
JMLR
2006
99views more  JMLR 2006»
15 years 6 months ago
Worst-Case Analysis of Selective Sampling for Linear Classification
A selective sampling algorithm is a learning algorithm for classification that, based on the past observed data, decides whether to ask the label of each new instance to be classi...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...
ENTCS
2007
119views more  ENTCS 2007»
15 years 6 months ago
Interpolant Learning and Reuse in SAT-Based Model Checking
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...
João Marques-Silva
AUTOMATICA
2005
86views more  AUTOMATICA 2005»
15 years 6 months ago
Sensitivity shaping with degree constraint by nonlinear least-squares optimization
This paper presents a new approach to shaping of the frequency response of the sensitivity function. In this approach, a desired frequency response is assumed to be specified at a...
Ryozo Nagamune, Anders Blomqvist