Sciweavers

2100 search results - page 141 / 420
» Fundamentals of the problem
Sort
View
TAPSOFT
1997
Springer
15 years 10 months ago
On the Complexity of Function Pointer May-Alias Analysis
This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C...
Robert Muth, Saumya K. Debray
AHSWN
2005
171views more  AHSWN 2005»
15 years 6 months ago
Topology Control and Localization in Wireless Ad Hoc and Sensor Networks
Over the last few years, novel architectures like ad hoc and sensor networks have introduced new challenges in the way the communication infrastructure must be addressed. Unlike t...
Peter Gober, Artur Ziviani, Petia Todorova, Marcel...
BMCBI
2008
211views more  BMCBI 2008»
15 years 6 months ago
CPSP-tools - Exact and complete algorithms for high-throughput 3D lattice protein studies
Background: The principles of protein folding and evolution pose problems of very high inherent complexity. Often these problems are tackled using simplified protein models, e.g. ...
Martin Mann, Sebastian Will, Rolf Backofen
PODS
2007
ACM
139views Database» more  PODS 2007»
16 years 6 months ago
Management of probabilistic data: foundations and challenges
Many applications today need to manage large data sets with uncertainties. In this paper we describe the foundations of managing data where the uncertainties are quantified as pro...
Nilesh N. Dalvi, Dan Suciu
TARK
2007
Springer
16 years 8 days ago
Preservation of epistemic properties in security protocol implementations
We introduce (i) a general class of security protocols with private channel as cryptographic primitive and (ii) a probabilistic epistemic logic to express properties of security pr...
Ron van der Meyden, Thomas Wilke