Sciweavers

2254 search results - page 257 / 451
» Computing the minimal covering set
Sort
View
JSCIC
2010
231views more  JSCIC 2010»
15 years 1 months ago
Geometric Applications of the Split Bregman Method: Segmentation and Surface Reconstruction
Variational models for image segmentation have many applications, but can be slow to compute. Recently, globally convex segmentation models have been introduced which are very rel...
Tom Goldstein, Xavier Bresson, Stanley Osher
DAC
2011
ACM
14 years 6 months ago
TPM-SIM: a framework for performance evaluation of trusted platform modules
This paper presents a simulation toolset for estimating the impact of Trusted Platform Modules (TPMs) on the performance of applications that use TPM services, especially in multi...
Jared Schmitz, Jason Loew, Jesse Elwell, Dmitry Po...
ESA
2006
Springer
130views Algorithms» more  ESA 2006»
15 years 10 months ago
Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...
Michal Meyerovitch
RECOMB
2008
Springer
16 years 7 months ago
A Phylogenetic Approach to Genetic Map Refinement
Following various genetic mapping techniques conducted on different segregating populations, one or more genetic maps are obtained for a given species. However, recombination analy...
Denis Bertrand, Mathieu Blanchette, Nadia El-Mabro...
CCECE
2009
IEEE
16 years 1 months ago
A distributed and cooperative supervisory estimation of multi-agent systems - Part I: Framework
Abstract—In this work, we propose a framework for supervisory cooperative estimation of multi-agent linear time-invariant (LTI) systems. We introduce a group of sub-observers, ea...
Seyyedmohsen Azizi, Mani M. Tousi, Kash Khorasani