Sciweavers

252 search results - page 7 / 51
» On partitions of discrete boxes
Sort
View
SIGGRAPH
2010
ACM
14 years 2 days ago
SmartBoxes for interactive urban reconstruction
We introduce an interactive tool which enables a user to quickly assemble an architectural model directly over a 3D point cloud acquired from large-scale scanning of an urban scen...
Liangliang Nan, Andrei Sharf, Hao Zhang, Daniel Co...
ICML
2004
IEEE
14 years 8 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
EMMCVPR
2011
Springer
12 years 7 months ago
Optimality Bounds for a Variational Relaxation of the Image Partitioning Problem
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...
Jan Lellmann, Frank Lenzen, Christoph Schnörr
GECCO
2006
Springer
147views Optimization» more  GECCO 2006»
13 years 11 months ago
Generalized cycle crossover for graph partitioning
We propose a new crossover that generalizes cycle crossover to permutations with repetitions and naturally suits partition problems. We tested it on graph partitioning problems ob...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon, Byun...
DIGITALCITIES
2001
Springer
14 years 2 days ago
Little Boxes, Glocalization, and Networked Individualism
Much thinking about digital cities is in terms of community groups. Yet, the world is composed of social networks and not of groups. This paper traces how communities have changed ...
Barry Wellman