Sciweavers

1066 search results - page 112 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
172
Voted
CORR
2008
Springer
190views Education» more  CORR 2008»
15 years 3 months ago
Chain-Based Representations for Solid and Physical Modeling
In this paper we show that the (co)chain complex associated with a decomposition of the computational domain, commonly called a mesh in computational science and engineering, can b...
Antonio DiCarlo, Franco Milicchio, Alberto Paoluzz...
CDC
2010
IEEE
144views Control Systems» more  CDC 2010»
14 years 11 months ago
Formal analysis of piecewise affine systems through formula-guided refinement
Abstract-- We present a computational framework for identifying a set of initial states from which all trajectories of a piecewise affine (PWA) system satisfy a Linear Temporal Log...
Boyan Yordanov, Jana Tumova, Calin Belta, Ivana Ce...
147
Voted
ANOR
2011
117views more  ANOR 2011»
14 years 8 months ago
A simple and effective algorithm for the MaxMin diversity problem
The challenge of maximizing the diversity of a collection of points arises in a variety of settings, including the setting of search methods for hard optimization problems. One ver...
Daniel Cosmin Porumbel, Jin-Kao Hao, Fred Glover
CONCUR
1993
Springer
15 years 8 months ago
Loop Parallelization in the Polytope Model
During the course of the last decade, a mathematical model for the parallelization of FOR-loops has become increasingly popular. In this model, a (perfect) nest of r FOR-loops is r...
Christian Lengauer
ICCV
2009
IEEE
16 years 9 months ago
FLoSS: Facility Location for Subspace Segmentation
Subspace segmentation is the task of segmenting data lying on multiple linear subspaces. Its applications in computer vision include motion segmentation in video, structure-from...
Nevena Lazic, Inmar Givoni, Brendan Frey