Sciweavers

659 search results - page 117 / 132
» Dynamic Algorithms for Graph Spanners
Sort
View
ICDM
2006
IEEE
137views Data Mining» more  ICDM 2006»
15 years 4 months ago
Mining Complex Time-Series Data by Learning Markovian Models
In this paper, we propose a novel and general approach for time-series data mining. As an alternative to traditional ways of designing specific algorithm to mine certain kind of ...
Yi Wang, Lizhu Zhou, Jianhua Feng, Jianyong Wang, ...
IPPS
2006
IEEE
15 years 4 months ago
An adaptive stabilization framework for distributed hash tables
Distributed Hash Tables (DHT) algorithms obtain good lookup performance bounds by using deterministic rules to organize peer nodes into an overlay network. To preserve the invaria...
Gabriel Ghinita, Yong Meng Teo
ICCV
2005
IEEE
15 years 3 months ago
Space-Time Scene Manifolds
The space of images is known to be a non-linear subspace that is difficult to model. This paper derives an algorithm that walks within this space. We seek a manifold through the ...
Yonatan Wexler, Denis Simakov
ICDM
2005
IEEE
148views Data Mining» more  ICDM 2005»
15 years 3 months ago
Hot Item Mining and Summarization from Multiple Auction Web Sites
Online auction Web sites are fast changing, highly dynamic, and complex as they involve tremendous sellers and potential buyers, as well as a huge amount of items listed for biddi...
Tak-Lam Wong, Wai Lam
SAT
2005
Springer
133views Hardware» more  SAT 2005»
15 years 3 months ago
Solving Over-Constrained Problems with SAT Technology
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà