Sciweavers

1132 search results - page 195 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
ICDM
2008
IEEE
172views Data Mining» more  ICDM 2008»
14 years 4 months ago
Active Learning of Equivalence Relations by Minimizing the Expected Loss Using Constraint Inference
Selecting promising queries is the key to effective active learning. In this paper, we investigate selection techniques for the task of learning an equivalence relation where the ...
Steffen Rendle, Lars Schmidt-Thieme
VTC
2008
IEEE
153views Communications» more  VTC 2008»
14 years 4 months ago
Analytical Model for Message Propagation in Delay Tolerant Vehicular Ad Hoc Networks
–In this paper we present an analytical model for delay tolerant message propagation in a dynamic vehicular network. The analysis provides upper and lower bounds for message prop...
Ashish Agarwal, David Starobinski, Thomas D. C. Li...
IPCCC
2007
IEEE
14 years 4 months ago
O(log n)-Localized Algorithms on the Coverage Problem in Heterogeneous Sensor Networks
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
My T. Thai, Yingshu Li, Feng Wang 0002
VTC
2007
IEEE
14 years 4 months ago
Opportunistic Feedback Protocol for Achieving Sum-Capacity of the MIMO Broadcast Channel
—This paper presents an opportunistic feedback (OF) protocol that achieves the asymptotic sum-capacity of the fading broadcast channel (BC) with a limited amount of feedback. The...
Rajiv Agarwal, Chan-Soo Hwang, John M. Cioffi
CSL
2007
Springer
14 years 4 months ago
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
Alexander Hertel, Alasdair Urquhart