Sciweavers

715 search results - page 131 / 143
» Neighborhood structures for genetic local search algorithms
Sort
View
MSV
2004
13 years 9 months ago
S(b)-Trees: An Optimal Balancing of Variable Length Keys
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
Konstantin V. Shvachko
ECSQARU
2005
Springer
14 years 2 months ago
On the Use of Restrictions for Learning Bayesian Networks
In this paper we explore the use of several types of structural restrictions within algorithms for learning Bayesian networks. These restrictions may codify expert knowledge in a g...
Luis M. de Campos, Javier Gomez Castellano
KDD
2006
ACM
156views Data Mining» more  KDD 2006»
14 years 8 months ago
Unsupervised learning on k-partite graphs
Various data mining applications involve data objects of multiple types that are related to each other, which can be naturally formulated as a k-partite graph. However, the resear...
Bo Long, Xiaoyun Wu, Zhongfei (Mark) Zhang, Philip...
WOWMOM
2005
ACM
240views Multimedia» more  WOWMOM 2005»
14 years 2 months ago
An Adaptive Routing Protocol for Ad Hoc Peer-to-Peer Networks
Ad hoc networks represent a key factor in the evolution of wireless communications. These networks typically consist of equal nodes that communicate without central control, inter...
Luca Gatani, Giuseppe Lo Re, Salvatore Gaglio
MM
2009
ACM
198views Multimedia» more  MM 2009»
14 years 1 months ago
Scalable detection of partial near-duplicate videos by visual-temporal consistency
Following the exponential growth of social media, there now exist huge repositories of videos online. Among the huge volumes of videos, there exist large numbers of near-duplicate...
Hung-Khoon Tan, Chong-Wah Ngo, Richang Hong, Tat-S...