Sciweavers

1012 search results - page 34 / 203
» Segment intersection searching problems in general settings
Sort
View
CVPR
2003
IEEE
15 years 5 months ago
Graph-Theoretic Approach to Clustering and Segmentation
We develop a framework for the image segmentation problem based on a new graph-theoretic formulation of clustering. The approach is motivated by the analogies between the intuitiv...
Massimiliano Pavan, Marcello Pelillo
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
16 years 5 days ago
Aggregating time partitions
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Evimaria Terzi, Panayiotis Tsaparas, Taneli Mielik...
77
Voted
CEC
2010
IEEE
15 years 27 days ago
A modified genetic algorithm for matching building sets with the histograms of forces
Abstract--This paper presents an approach to the task of locating a group of buildings based solely on their relative spatial relationships. This situation can occur in the problem...
Andrew R. Buck, James M. Keller, Marjorie Skubic
74
Voted
AAAI
1997
15 years 1 months ago
Evidence for Invariants in Local Search
It is well known that the performance of a stochastic local search procedure depends upon the setting of its noise parameter, and that the optimal setting varies with the problem ...
David A. McAllester, Bart Selman, Henry A. Kautz
WIDM
2006
ACM
15 years 5 months ago
Identifying redundant search engines in a very large scale metasearch engine context
For a given set of search engines, a search engine is redundant if its searchable contents can be found from other search engines in this set. In this paper, we propose a method t...
Ronak Desai, Qi Yang, Zonghuan Wu, Weiyi Meng, Cle...