Sciweavers

2925 search results - page 105 / 585
» Information Complexity of Online Problems
Sort
View
PODS
2007
ACM
196views Database» more  PODS 2007»
16 years 6 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
15 years 10 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
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
ANOR
2006
70views more  ANOR 2006»
15 years 6 months ago
Optimization problems in electron microscopy of single particles
Electron Microscopy is a valuable tool for the elucidation of the three-dimensional structure of macromolecular complexes. Knowledge about the macromolecular structure provides imp...
Carlos Oscar Sánchez Sorzano, Roberto Marab...
JCSS
2010
112views more  JCSS 2010»
15 years 4 months ago
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
To make a joint decision, agents (or voters) are often required to provide their preferences as linear orders. To determine a winner, the given linear orders can be aggregated acc...
Nadja Betzler, Britta Dorn