Sciweavers

944 search results - page 147 / 189
» Heuristic Search for Large Problems With Real Costs
Sort
View
DBA
2006
236views Database» more  DBA 2006»
14 years 11 months ago
Quantizing Time Series for Efficient Subsequence Matching
Indexing time series data is an interesting problem that has attracted much interest in the research community for the last decade. Traditional indexing methods organize the data ...
Inés Fernando Vega López, Bongki Moo...
INFOCOM
2002
IEEE
15 years 2 months ago
Optimal Configuration of OSPF Aggregates
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
Rajeev Rastogi, Yuri Breitbart, Minos N. Garofalak...
CP
2003
Springer
15 years 3 months ago
A SAT-Based Approach to Multiple Sequence Alignment
Multiple sequence alignment is a central problem in Bioinformatics. A known integer programming approach is to apply branch-and-cut to exponentially large graph-theoretic models. T...
Steven David Prestwich, Desmond G. Higgins, Orla O...
DAGM
2010
Springer
14 years 11 months ago
Image Segmentation with a Statistical Appearance Model and a Generic Mumford-Shah Inspired Outside Model
Abstract. We present a novel statistical-model-based segmentation algorithm that addresses a recurrent problem in appearance model fitting and model-based segmentation: the "s...
Thomas Albrecht, Thomas Vetter
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
15 years 3 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung