Sciweavers

6315 search results - page 408 / 1263
» Approximating Solution Structure
Sort
View
NETWORKS
2010
15 years 5 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
JAIR
2010
130views more  JAIR 2010»
15 years 1 months ago
Interactive Cost Configuration Over Decision Diagrams
In many AI domains such as product configuration, a user should interactively specify a solution that must satisfy a set of constraints. In such scenarios, offline compilation of ...
Henrik Reif Andersen, Tarik Hadzic, David Pisinger
JMLR
2012
13 years 9 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
CVPR
2008
IEEE
16 years 9 months ago
Large-scale manifold learning
This paper examines the problem of extracting lowdimensional manifold structure given millions of highdimensional face images. Specifically, we address the computational challenge...
Ameet Talwalkar, Sanjiv Kumar, Henry A. Rowley
ICIP
2005
IEEE
16 years 8 months ago
Content-based video copy detection in large databases: a local fingerprints statistical similarity search approach
Recent methods based on interest points and local fingerprints have been proposed to perform robust CBCD (content-based copy detection) of images and video. They include two steps...
Alexis Joly, Carl Frélicot, Olivier Buisson