Sciweavers

2656 search results - page 307 / 532
» Design and analysis of algorithms reconsidered
Sort
View
IPSN
2010
Springer
16 years 1 months ago
Covering space for in-network sensor data storage
For in-network storage schemes, one maps data, indexed in a logical space, to the distributed sensor locations. When the physical sensor network has an irregular shape and possibl...
Rik Sarkar, Wei Zeng, Jie Gao, Xianfeng David Gu
INFOCOM
2007
IEEE
16 years 1 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...
MCS
2001
Springer
15 years 11 months ago
Finding Consistent Clusters in Data Partitions
Abstract. Given an arbitrary data set, to which no particular parametrical, statistical or geometrical structure can be assumed, different clustering algorithms will in general pr...
Ana L. N. Fred
ISAAC
1992
Springer
125views Algorithms» more  ISAAC 1992»
15 years 11 months ago
A Simple Test for the Consecutive Ones Property
A (0,1)-matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueke...
Wen-Lian Hsu
FCSC
2007
159views more  FCSC 2007»
15 years 7 months ago
Ranking with uncertain labels and its applications
1 The techniques for image analysis and classi cation generally consider the image sample labels xed and without uncertainties. The rank regression problem is studied in this pape...
Shuicheng Yan, Huan Wang, Jianzhuang Liu, Xiaoou T...