Sciweavers

5463 search results - page 1073 / 1093
» Evaluating algorithms that learn from data streams
Sort
View
83
Voted
WWW
2008
ACM
15 years 10 months ago
Characterizing typical and atypical user sessions in clickstreams
Millions of users retrieve information from the Internet using search engines. Mining these user sessions can provide valuable information about the quality of user experience and...
Narayanan Sadagopan, Jie Li
SENSYS
2009
ACM
15 years 5 months ago
Collection tree protocol
This paper presents and evaluates two principles for wireless routing protocols. The first is datapath validation: data traffic quickly discovers and fixes routing inconsistenc...
Omprakash Gnawali, Rodrigo Fonseca, Kyle Jamieson,...
72
Voted
SENSYS
2005
ACM
15 years 3 months ago
Sympathy for the sensor network debugger
Being embedded in the physical world, sensor networks present a wide range of bugs and misbehavior qualitatively different from those in most distributed systems. Unfortunately, d...
Nithya Ramanathan, Kevin K. Chang, Rahul Kapur, Le...
ASPLOS
1992
ACM
15 years 2 months ago
Parity Declustering for Continuous Operation in Redundant Disk Arrays
We describe and evaluate a strategy for declustering the parity encoding in a redundant disk array. This declustered parity organization balances cost against data reliability and...
Mark Holland, Garth A. Gibson
BMCBI
2007
115views more  BMCBI 2007»
14 years 10 months ago
Comparing sequences without using alignments: application to HIV/SIV subtyping
Background: In general, the construction of trees is based on sequence alignments. This procedure, however, leads to loss of informationwhen parts of sequence alignments (for inst...
Gilles Didier, Laurent Debomy, Maude Pupin, Ming Z...
« Prev « First page 1073 / 1093 Last » Next »