Sciweavers

32545 search results - page 310 / 6509
» Data Structures and Algorithms
Sort
View
DCOSS
2005
Springer
16 years 8 days ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
15 years 6 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri
JDCTA
2010
228views more  JDCTA 2010»
15 years 1 months ago
Research and Progress of Cluster Algorithms based on Granular Computing
Granular Computing (GrC), a knowledge-oriented computing which covers the theory of fuzzy information granularity, rough set theory, the theory of quotient space and interval comp...
Shifei Ding, Li Xu, Hong Zhu, Liwen Zhang
BMCBI
2010
164views more  BMCBI 2010»
15 years 4 months ago
Merged consensus clustering to assess and improve class discovery with microarray data
Background: One of the most commonly performed tasks when analysing high throughput gene expression data is to use clustering methods to classify the data into groups. There are a...
T. Ian Simpson, J. Douglas Armstrong, Andrew P. Ja...
STACS
1992
Springer
15 years 10 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...