Sciweavers

1331 search results - page 114 / 267
» Complexity bounds for zero-test algorithms
Sort
View
COMSUR
2011
203views Hardware» more  COMSUR 2011»
12 years 10 months ago
Overcoming Adversaries in Sensor Networks: A Survey of Theoretical Models and Algorithmic Approaches for Tolerating Malicious In
Interference is an unavoidable property of the wireless communication medium and, in sensor networks, such interference is exacerbated due to the energy-starved nature of the netw...
Maxwell Young, Raouf Boutaba
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
14 years 10 months ago
Fastanova: an efficient algorithm for genome-wide association study
Studying the association between quantitative phenotype (such as height or weight) and single nucleotide polymorphisms (SNPs) is an important problem in biology. To understand und...
Xiang Zhang, Fei Zou, Wei Wang 0010
PODC
2011
ACM
13 years 1 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
TSP
2008
89views more  TSP 2008»
13 years 10 months ago
Coordinated Beamforming for the Multiuser MIMO Broadcast Channel With Limited Feedforward
Abstract-- Linear transmit beamforming and receive combining is a low complexity approach for communications in the multiuser multiple-input multiple-output (MIMO) channel. This pa...
Chan-Byoung Chae, David Mazzarese, Takao Inoue, Ro...
ALT
2006
Springer
14 years 7 months ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro