Sciweavers

5153 search results - page 797 / 1031
» Introduction to Randomized Algorithms
Sort
View
120
Voted
ACTA
2006
104views more  ACTA 2006»
15 years 3 months ago
Safe projections of binary data sets
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
Nikolaj Tatti
ANOR
2006
133views more  ANOR 2006»
15 years 3 months ago
An integrated model for logistics network design
In this paper we introduce a new formulation of the logistics network design problem encountered in deterministic, single-country, single-period contexts. Our formulation is flexi...
Jean-François Cordeau, Federico Pasin, Mari...
128
Voted
DSP
2006
15 years 3 months ago
Adaptive multi-modality sensor scheduling for detection and tracking of smart targets
This paper considers the problem of sensor scheduling for the purposes of detection and tracking of "smart" targets. Smart targets are targets that can detect when they ...
Christopher M. Kreucher, Doron Blatt, Alfred O. He...
152
Voted
CN
2007
154views more  CN 2007»
15 years 3 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
CORR
2007
Springer
120views Education» more  CORR 2007»
15 years 3 months ago
Distributed Fair Scheduling Using Variable Transmission Lengths in Carrier-Sensing-based Wireless Networks
— The fairness of IEEE 802.11 wireless networks (including Wireless LAN and Ad-hoc networks) is hard to predict and control because of the randomness and complexity of the MAC co...
Libin Jiang, Jean C. Walrand