Sciweavers

CORR
2010
Springer
100views Education» more  CORR 2010»
13 years 11 months ago
Radio Interface for High Data Rate Wireless Sensor Networks
This paper gives an overview of radio interfaces devoted for high data rate Wireless Sensor Networks. Four aerospace applications of WSN are presented to underline the importance ...
Julien Henaut, Aubin Lecointre, Daniela Dragomires...
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 11 months ago
Opportunistic Routing in Ad Hoc Networks: How many relays should there be? What rate should nodes use?
Opportunistic routing is a multi-hop routing scheme which allows for selection of the best immediately available relay. In blind opportunistic routing protocols, where transmitters...
Joseph Blomer, Nihar Jindal
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 11 months ago
Optimal Direct Sum Results for Deterministic and Randomized Decision Tree Complexity
A Direct Sum Theorem holds in a model of computation, when for every problem solving some k input instances together is k times as expensive as solving one. We show that Direct Su...
Rahul Jain, Hartmut Klauck, Miklos Santha
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 11 months ago
Maximal Intersection Queries in Randomized Input Models
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits...
CORR
2010
Springer
175views Education» more  CORR 2010»
13 years 11 months ago
Incorporating Side Information in Probabilistic Matrix Factorization with Gaussian Processes
Probabilistic matrix factorization (PMF) is a powerful method for modeling data associated with pairwise relationships, finding use in collaborative filtering, computational biolo...
Ryan Prescott Adams, George E. Dahl, Iain Murray
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 11 months ago
Logical complexity of graphs: a survey
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
Oleg Pikhurko, Oleg Verbitsky
CORR
2010
Springer
126views Education» more  CORR 2010»
13 years 11 months ago
Game interpretation of Kolmogorov complexity
Andrej Muchnik, Ilya Mezhirov, Alexander Shen, Nik...
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 11 months ago
MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
Abstract. CG, SYMMLQ, and MINRES are Krylov subspace methods for solving large symmetric systems of linear equations. CG (the conjugate-gradient method) is reliable on positive-def...
Sou-Cheng T. Choi, Christopher C. Paige, Michael A...
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 11 months ago
A tight quantitative version of Arrow's impossibility theorem
The well-known Impossibility Theorem of Arrow asserts that any Generalized Social Welfare Function (GSWF) with at least three alternatives, which satisfies Independence of Irrelev...
Nathan Keller