Sciweavers

2698 search results - page 419 / 540
» Approximation Algorithms for the Weighted Independent Set Pr...
Sort
View
TSP
2010
15 years 1 months ago
Universal randomized switching
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
Suleyman Serdar Kozat, Andrew C. Singer
SDM
2009
SIAM
167views Data Mining» more  SDM 2009»
16 years 3 months ago
Parallel Pairwise Clustering.
Given the pairwise affinity relations associated with a set of data items, the goal of a clustering algorithm is to automatically partition the data into a small number of homogen...
Elad Yom-Tov, Noam Slonim
DAM
2007
153views more  DAM 2007»
15 years 6 months ago
Computing the minimum number of hybridization events for a consistent evolutionary history
It is now well-documented that the structure of evolutionary relationships between a set of present-day species is not necessarily tree-like. The reason for this is that reticulat...
Magnus Bordewich, Charles Semple
ICDM
2002
IEEE
143views Data Mining» more  ICDM 2002»
15 years 11 months ago
A Hybrid Approach to Discover Bayesian Networks From Databases Using Evolutionary Programming
This paper describes a novel data mining approach that employs evolutionary programming to discover knowledge represented in Bayesian networks. There are two different approaches ...
Man Leung Wong, Shing Yan Lee, Kwong-Sak Leung
WASA
2010
Springer
288views Algorithms» more  WASA 2010»
15 years 4 months ago
Approaching the Optimal Schedule for Data Aggregation in Wireless Sensor Networks
Abstract. Due to the large-scale ad hoc deployments and wireless interference, data aggregation is a fundamental but time consuming task in wireless sensor networks. This paper foc...
Pei Wang, Yuan He, Liusheng Huang