Sciweavers

194 search results - page 30 / 39
» Some problems, I care most
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
14 years 8 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...
EMMCVPR
2007
Springer
15 years 3 months ago
Simulating Classic Mosaics with Graph Cuts
Classic mosaic is one of the oldest and most durable art forms. There has been a growing interest in simulating classic mosaics from digital images recently. To be visually pleasin...
Yu Liu, Olga Veksler, Olivier Juan
MANSCI
2007
90views more  MANSCI 2007»
14 years 9 months ago
Selecting a Selection Procedure
Selection procedures are used in a variety of applications to select the best of a finite set of alternatives. ‘Best’ is defined with respect to the largest mean, but the me...
Jürgen Branke, Stephen E. Chick, Christian Sc...
EACL
2010
ACL Anthology
14 years 7 months ago
Generating Referring Expressions in Context: The GREC Task Evaluation Challenges
Until recently, referring expression generation (reg) research focused on the task of selecting the semantic content of definite mentions of listener-familiar discourse entities. I...
Anja Belz, Eric Kow, Jette Viethen, Albert Gatt
IROS
2007
IEEE
254views Robotics» more  IROS 2007»
15 years 3 months ago
3D datasets segmentation based on local attribute variation
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
Carla Silva Rocha Aguiar, Sébastien Druon, ...