Sciweavers

712 search results - page 37 / 143
» Sorting and selection on dynamic data
Sort
View
IDEAS
2005
IEEE
149views Database» more  IDEAS 2005»
15 years 5 months ago
An Adaptive Multi-Objective Scheduling Selection Framework for Continuous Query Processing
Adaptive operator scheduling algorithms for continuous query processing are usually designed to serve a single performance objective, such as minimizing memory usage or maximizing...
Timothy M. Sutherland, Yali Zhu, Luping Ding, Elke...
COMSWARE
2007
IEEE
15 years 6 months ago
Topology-based Clusterhead Candidate Selection in Wireless Ad-hoc and Sensor Networks
—Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. Neighboring devices elect one appropriate device as clusterhead. Due t...
Matthias R. Brust, Adrian Andronache, Steffen Roth...
IC
2004
15 years 1 months ago
Improved Selective Acknowledgment Scheme for TCP
A selective acknowledgment (SACK) mechanism, combined with a selective repeat retransmission policy, has been proposed to overcome the limitations with the cumulative acknowledgme...
Rajkumar Kettimuthu, William E. Allcock
ESTIMEDIA
2008
Springer
15 years 1 months ago
Translating data flow to synchronous block diagrams
We propose a method to automatically transform synchronous data flow diagrams into synchronous block diagrams. The idea is to use triggers, a mechanism that allows a block to be f...
Roberto Lublinerman, Stavros Tripakis
ICASSP
2008
IEEE
15 years 6 months ago
Discriminative feature selection for hidden Markov models using Segmental Boosting
We address the feature selection problem for hidden Markov models (HMMs) in sequence classification. Temporal correlation in sequences often causes difficulty in applying featur...
Pei Yin, Irfan A. Essa, Thad Starner, James M. Reh...