Sciweavers

1022 search results - page 138 / 205
» New models and algorithms for programmable networks
Sort
View
ICDE
2011
IEEE
245views Database» more  ICDE 2011»
14 years 9 months ago
Discovering popular routes from trajectories
—The booming industry of location-based services has accumulated a huge collection of users’ location trajectories of driving, cycling, hiking, etc. In this work, we investigat...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou
201
Voted
DMTCS
2010
146views Mathematics» more  DMTCS 2010»
15 years 3 months ago
Tight Bounds for Delay-Sensitive Aggregation
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
Yvonne Anne Pignolet, Stefan Schmid, Roger Wattenh...
189
Voted
SACMAT
2006
ACM
16 years 1 days ago
The secondary and approximate authorization model and its application to Bell-LaPadula policies
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
Jason Crampton, Wing Leung, Konstantin Beznosov
BMCBI
2005
198views more  BMCBI 2005»
15 years 6 months ago
Clustering protein sequences with a novel metric transformed from sequence similarity scores and sequence alignments with neural
Background: The sequencing of the human genome has enabled us to access a comprehensive list of genes (both experimental and predicted) for further analysis. While a majority of t...
Qicheng Ma, Gung-Wei Chirn, Richard Cai, Joseph D....
ICCS
2004
Springer
15 years 11 months ago
Using Runtime Measurements and Historical Traces for Acquiring Knowledge in Parallel Applications
Abstract. A new approach for acquiring knowledge of parallel applications regarding resource usage and for searching similarity on workload traces is presented. The main goal is to...
Luciano José Senger, Marcos José San...