Sciweavers

1640 search results - page 200 / 328
» Conditional Independence Trees
Sort
View
111
Voted
CORR
2011
Springer
175views Education» more  CORR 2011»
14 years 9 months ago
Finitary languages
Abstract The class of ω-regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness...
Krishnendu Chatterjee, Nathanaël Fijalkow
BMCBI
2006
128views more  BMCBI 2006»
15 years 2 months ago
An interactive tool for visualization of relationships between gene expression profiles
Background: Application of phenetic methods to gene expression analysis proved to be a successful approach. Visualizing the results in a 3-dimentional space may further enhance th...
Peter Ruzanov, Steven J. M. Jones
COMGEO
2006
ACM
15 years 2 months ago
Octrees with near optimal cost for ray-shooting
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applica...
Hervé Brönnimann, Marc Glisse
COMCOM
2004
98views more  COMCOM 2004»
15 years 2 months ago
End system multicast: an architectural infrastructure and topological optimization
Although IP-multicast has been proposed and investigated for years, there are major problems inherent in the IP-multicasting technique, e.g., difficulty to scale up the system, di...
Starsky H. Y. Wong, John C. S. Lui
198
Voted
POPL
2011
ACM
14 years 5 months ago
Decidable logics combining heap structures and data
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
P. Madhusudan, Gennaro Parlato, Xiaokang Qiu