Sciweavers

828 search results - page 134 / 166
» Bounded Hairpin Completion
Sort
View
COR
2008
131views more  COR 2008»
13 years 9 months ago
Comparing methods for multiattribute decision making with ordinal weights
This paper is concerned with procedures for ranking discrete alternatives when their values are evaluated precisely on multiple attributes and the attribute weights are known only...
Byeong Seok Ahn, Kyung Sam Park
MONET
2007
111views more  MONET 2007»
13 years 9 months ago
Resource Discovery in Activity-Based Sensor Networks
— This paper proposes a service discovery protocol for sensor networks that is specifically tailored for use in humancentered pervasive environments. It uses the high-level conc...
Doina Bucur, Jakob E. Bardram
PVLDB
2008
111views more  PVLDB 2008»
13 years 9 months ago
Approximate lineage for probabilistic databases
In probabilistic databases, lineage is fundamental to both query processing and understanding the data. Current systems s.a. Trio or Mystiq use a complete approach in which the li...
Christopher Ré, Dan Suciu
IWSEC
2010
Springer
13 years 8 months ago
Optimal Adversary Behavior for the Serial Model of Financial Attack Trees
Abstract. Attack tree analysis is used to estimate different parameters of general security threats based on information available for atomic subthreats. We focus on estimating the...
Margus Niitsoo
RP
2010
Springer
146views Control Systems» more  RP 2010»
13 years 8 months ago
Depth Boundedness in Multiset Rewriting Systems with Name Binding
Abstract. In this paper we consider ν-MSR, a formalism that combines the two main existing approaches for multiset rewriting, namely MSR and CMRS. In ν-MSR we rewrite multisets o...
Fernando Rosa Velardo