Sciweavers

8728 search results - page 1320 / 1746
» On Reduct Construction Algorithms
Sort
View
MCS
2007
Springer
16 years 1 months ago
Selecting Diversifying Heuristics for Cluster Ensembles
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...
Stefan Todorov Hadjitodorov, Ludmila I. Kuncheva
BIBE
2006
IEEE
135views Bioinformatics» more  BIBE 2006»
16 years 29 days ago
Evidence of Multiple Maximum Likelihood Points for a Phylogenetic Tree
An interesting and important, but largely ignored question associated with the ML method is whether there exists only a single maximum likelihood point for a given phylogenetic tr...
Bing Bing Zhou, Monther Tarawneh, Pinghao Wang, Da...
MM
2006
ACM
93views Multimedia» more  MM 2006»
16 years 25 days ago
Scaling laws and tradeoffs in peer-to-peer live multimedia streaming
It is well-known that live multimedia streaming applications operate more efficiently when organized in peer-to-peer (P2P) topologies, since peer upload capacities are utilized t...
Tara Small, Ben Liang, Baochun Li
TPHOL
2005
IEEE
16 years 14 days ago
A HOL Theory of Euclidean Space
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
John Harrison
WAOA
2005
Springer
177views Algorithms» more  WAOA 2005»
16 years 11 days ago
Approximation and Complexity of k-Splittable Flows
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
Ronald Koch, Martin Skutella, Ines Spenke
« Prev « First page 1320 / 1746 Last » Next »