Sciweavers

321 search results - page 41 / 65
» Comparison of Additive Trees Using Circular Orders
Sort
View
CORR
2007
Springer
133views Education» more  CORR 2007»
13 years 7 months ago
On Decidability Properties of Local Sentences
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
Olivier Finkel
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
14 years 7 months ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 7 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
TAMC
2007
Springer
14 years 1 months ago
Improving the Average Delay of Sorting
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
Andreas Jakoby, Maciej Liskiewicz, Rüdiger Re...
BMCBI
2006
87views more  BMCBI 2006»
13 years 7 months ago
MathDAMP: a package for differential analysis of metabolite profiles
Background: With the advent of metabolomics as a powerful tool for both functional and biomarker discovery, the identification of specific differences between complex metabolite p...
Richard Baran, Hayataro Kochi, Natsumi Saito, Mako...