Sciweavers

4486 search results - page 356 / 898
» Adaptable Boundary Sets
Sort
View
MICRO
2007
IEEE
164views Hardware» more  MICRO 2007»
16 years 1 months ago
A Practical Approach to Exploiting Coarse-Grained Pipeline Parallelism in C Programs
The emergence of multicore processors has heightened the need for effective parallel programming practices. In addition to writing new parallel programs, the next generation of pr...
William Thies, Vikram Chandrasekhar, Saman P. Amar...
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 7 months ago
Nodally 3-connected planar graphs and convex combination mappings
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
Colm Ó'Dúnlaing
JMLR
2002
89views more  JMLR 2002»
15 years 7 months ago
A Robust Minimax Approach to Classification
When constructing a classifier, the probability of correct classification of future data points should be maximized. We consider a binary classification problem where the mean and...
Gert R. G. Lanckriet, Laurent El Ghaoui, Chiranjib...
TIP
2010
205views more  TIP 2010»
15 years 2 months ago
Variational Region-Based Segmentation Using Multiple Texture Statistics
This paper addresses variational supervised texture segmentation. The main contributions are twofold. First, the proposed method circumvents a major problem related to classical t...
Imen Karoui, Ronan Fablet, Jean-Marc Boucher, Jean...
COMPGEOM
1996
ACM
15 years 11 months ago
Flipping Edges in Triangulations
A triangulation of a point set Pn is a partitioning of the convex hull Conv(Pn) into a set of triangles with disjoint interiors such that the vertices of these triangles are in Pn...
Ferran Hurtado, Marc Noy, Jorge Urrutia