Sciweavers

762 search results - page 92 / 153
» Finding Facilities Fast
Sort
View
CORR
2012
Springer
185views Education» more  CORR 2012»
12 years 5 months ago
Bayesian network learning with cutting planes
The problem of learning the structure of Bayesian networks from complete discrete data with a limit on parent set size is considered. Learning is cast explicitly as an optimisatio...
James Cussens
CVPR
2009
IEEE
15 years 5 months ago
A Convex Relaxation Approach for Computing Minimal Partitions
In this work we propose a convex relaxation approach for computing minimal partitions. Our approach is based on rewriting the minimal partition problem (also known as Potts mode...
Thomas Pock (Graz University of Technology), Anton...
ICIP
2003
IEEE
14 years 11 months ago
Generalized pattern matching using orbit decomposition
Image Processing and Computer Vision applications often require finding a particular pattern in a set of images. The task involves finding appearances of a given pattern in an ima...
Yacov Hel-Or, Hagit Hel-Or
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
14 years 11 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...
ICML
2000
IEEE
14 years 10 months ago
Duality and Geometry in SVM Classifiers
We develop an intuitive geometric interpretation of the standard support vector machine (SVM) for classification of both linearly separable and inseparable data and provide a rigo...
Kristin P. Bennett, Erin J. Bredensteiner