Sciweavers

4266 search results - page 263 / 854
» The container loading problem
Sort
View
WG
2010
Springer
15 years 3 months ago
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov...
ACL
2009
15 years 2 months ago
Compiling a Massive, Multilingual Dictionary via Probabilistic Inference
Can we automatically compose a large set of Wiktionaries and translation dictionaries to yield a massive, multilingual dictionary whose coverage is substantially greater than that...
Mausam, Stephen Soderland, Oren Etzioni, Daniel S....
141
Voted
ICIP
2009
IEEE
15 years 2 months ago
Automatic discovery of image families: Global vs. local features
Gathering a large collection of images has been made quite easy by social and image sharing websites, e.g. flickr.com. However, using such collections faces the problem that they ...
Mohamed Aly, Peter Welinder, Mario E. Munich, Piet...
JSCIC
2010
231views more  JSCIC 2010»
14 years 11 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
ICASSP
2011
IEEE
14 years 8 months ago
Decentralized support detection of multiple measurement vectors with joint sparsity
This paper considers the problem of finding sparse solutions from multiple measurement vectors (MMVs) with joint sparsity. The solutions share the same sparsity structure, and th...
Qing Ling, Zhi Tian