Sciweavers

8294 search results - page 974 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
VLDB
2007
ACM
131views Database» more  VLDB 2007»
16 years 7 months ago
Dissemination of compressed historical information in sensor networks
Sensor nodes are small devices that "measure" their environment and communicate feeds of low-level data values to a base station for further processing and archiving. Dis...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
CIKM
2011
Springer
14 years 7 months ago
MTopS: scalable processing of continuous top-k multi-query workloads
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
Avani Shastri, Di Yang, Elke A. Rundensteiner, Mat...
BMCBI
2007
133views more  BMCBI 2007»
15 years 7 months ago
An efficient pseudomedian filter for tiling microrrays
Background: Tiling microarrays are becoming an essential technology in the functional genomics toolbox. They have been applied to the tasks of novel transcript identification, elu...
Thomas E. Royce, Nicholas Carriero, Mark B. Gerste...
WWW
2006
ACM
16 years 8 months ago
Predictive modeling of first-click behavior in web-search
Search engine results are usually presented in some form of text summary (e.g., document title, some snippets of the page's content, a URL, etc). Based on the information con...
Maeve O'Brien, Mark T. Keane, Barry Smyth
EWSN
2009
Springer
16 years 8 months ago
Multi-hop Cluster Hierarchy Maintenance in Wireless Sensor Networks: A Case for Gossip-Based Protocols
Multi-hop cluster hierarchy has been presented as an organization for large wireless sensor networks (WSNs) that can provide scalable routing, data aggregation, and querying. In th...
Konrad Iwanicki, Maarten van Steen