Sciweavers

3177 search results - page 599 / 636
» Can We Have Confidence in a Tree Representation
Sort
View
PODS
2009
ACM
100views Database» more  PODS 2009»
14 years 8 months ago
Space-optimal heavy hitters with strong error bounds
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...
POPL
2005
ACM
14 years 8 months ago
Polymorphic bytecode: compositional compilation for Java-like languages
We define compositional compilation as the ability to typecheck source code fragments in isolation, generate corresponding binaries, and link together fragments whose mutual assum...
Davide Ancona, Ferruccio Damiani, Sophia Drossopou...
IAT
2009
IEEE
14 years 2 months ago
Introducing Communication in Dis-POMDPs with Finite State Machines
Distributed Partially Observable Markov Decision Problems (DisPOMDPs) are emerging as a popular approach for modeling sequential decision making in teams operating under uncertain...
Yuki Iwanari, Makoto Tasaki, Makoto Yokoo, Atsushi...
CSB
2005
IEEE
119views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Temperature and Mutation Switches in the Secondary Structure of Small RNAs
Conformational switching in the secondary structure of RNAs has recently attracted considerable attention, fostered by the discovery of ‘riboswitches’ in living organisms. The...
Assaf Avihoo, Danny Barash
AIIA
2005
Springer
14 years 1 months ago
Towards Fault-Tolerant Formal Concept Analysis
Given Boolean data sets which record properties of objects, Formal Concept Analysis is a well-known approach for knowledge discovery. Recent application domains, e.g., for very lar...
Ruggero G. Pensa, Jean-François Boulicaut