Sciweavers

587 search results - page 67 / 118
» On the Relative Sizes of Learnable Sets
Sort
View
TACAS
2010
Springer
170views Algorithms» more  TACAS 2010»
13 years 6 months ago
SLAB: A Certifying Model Checker for Infinite-State Concurrent Systems
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...
Klaus Dräger, Andrey Kupriyanov, Bernd Finkbe...
BMCBI
2011
13 years 3 months ago
VennDiagram: a package for the generation of highly-customizable Venn and Euler diagrams in R
Background: Visualization of orthogonal (disjoint) or overlapping datasets is a common task in bioinformatics. Few tools exist to automate the generation of extensively-customizab...
Hanbo Chen, Paul C. Boutros
COMPGEOM
2011
ACM
13 years 10 days ago
Reeb graphs: approximation and persistence
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
Tamal K. Dey, Yusu Wang
CVPR
2008
IEEE
14 years 10 months ago
Semantic-based indexing of fetal anatomies from 3-D ultrasound data using global/semi-local context and sequential sampling
The use of 3-D ultrasound data has several advantages over 2-D ultrasound for fetal biometric measurements, such as considerable decrease in the examination time, possibility of p...
Gustavo Carneiro, Fernando Amat, Bogdan Georgescu,...
IWPEC
2009
Springer
14 years 3 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...