2783 search results - page 84 / 557 » The Nature Of Near-Synonymic Relations |
126
click to vote
ICFP
2007
ACM
16 years 1 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
172
click to vote
CCA
2009
Springer
15 years 6 months ago
2009
Springer
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
115
click to vote
PODC
1999
ACM
15 years 5 months ago
1999
ACM
We present a new approach for reasoning about liveness properties of distributed systems, represented as automata. Our approach is based on simulation relations, and requires reas...
EFDBS
2001
15 years 2 months ago
2001
In this work, we consider augmenting SQL with constructs allowing dynamic restructuring. Dynamic restructuring occurs naturally in a framework including second-order capabilities f...
135
click to vote
BMCBI
2005
15 years 1 months ago
2005
Background: Routine application of gene expression microarray technology is rapidly producing large amounts of data that necessitate new approaches of analysis. The analysis of a ...