Sciweavers

315 search results - page 30 / 63
» An Optimal Algorithm for the Maximum-Density Segment Problem
Sort
View
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
14 years 7 months ago
Keyword query cleaning using hidden Markov models
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
Ken Q. Pu
STOC
1995
ACM
115views Algorithms» more  STOC 1995»
13 years 11 months ago
Geometric lower bounds for parametric matroid optimization
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
David Eppstein
ICIP
2002
IEEE
14 years 9 months ago
Region-based retrieval: coarse segmentation with fine color signature
The two major problems raised by a region-based image retrieval system are the automatic definition and description of regions. In this paper we first present a technique of unsup...
Julien Fauqueur, Nozha Boujemaa
CVPR
2010
IEEE
14 years 3 months ago
Learning Full Pairwise Affinities for Spectral Segmentation
This paper studies the problem of learning a full range of pairwise affinities gained by integrating local grouping cues for spectral segmentation. The overall quality of the spect...
Tae Hoon Kim (Seoul National University), Kyoung M...
ICCV
2007
IEEE
14 years 9 months ago
Locally-Constrained Region-Based Methods for DW-MRI Segmentation
In this paper, we describe a method for segmenting fiber bundles from diffusion-weighted magnetic resonance images using a locally-constrained region based approach. From a pre-co...
John Melonakos, Marc Niethammer, Vandana Mohan, Ma...