Sciweavers

444 search results - page 67 / 89
» Instance optimal query processing in spatial networks
Sort
View
MOBICOM
2004
ACM
14 years 1 months ago
Revisiting the TTL-based controlled flooding search: optimality and randomization
In this paper we consider the problem of searching for a node or an object (i.e., piece of data, file, etc.) in a large network. Applications of this problem include searching fo...
Nicholas B. Chang, Mingyan Liu
EGITALY
2006
13 years 9 months ago
Color Palette Images Re-indexing by Self Organizing Motor Maps
Palette re-ordering is a well known and very effective approach for improving the compression of color-indexed images. If the spatial distribution of the indexes in the image is s...
Sebastiano Battiato, Francesco Rundo, Filippo Stan...
TWC
2011
367views more  TWC 2011»
13 years 2 months ago
Improving the Performance of Wireless Ad Hoc Networks Through MAC Layer Design
—In this paper, the performance of the ALOHA and CSMA MAC protocols are analyzed in spatially distributed wireless networks. The main system objective is correct reception of pac...
Mariam Kaynia, Nihar Jindal, Geir E. Øien
CIKM
2010
Springer
13 years 6 months ago
Combining link and content for collective active learning
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
Lixin Shi, Yuhang Zhao, Jie Tang
ICDT
2005
ACM
128views Database» more  ICDT 2005»
14 years 1 months ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...