Sciweavers

359 search results - page 22 / 72
» Solving Geometric Covering Problems by Data Reduction
Sort
View
HIS
2009
13 years 5 months ago
A Swarm-Based Rough Set Approach for Group Decision Support Systems
This paper present a class of investment problem, in which many items could be chosen in a group decision environment. Usually there is a decision table from the board of director...
Mingyan Zhao, Hongbo Liu, Ajith Abraham, Emilio Co...
ICML
2005
IEEE
14 years 8 months ago
Action respecting embedding
Dimensionality reduction is the problem of finding a low-dimensional representation of highdimensional input data. This paper examines the case where additional information is kno...
Michael H. Bowling, Ali Ghodsi, Dana F. Wilkinson
PAMI
2011
13 years 2 months ago
Multiple Kernel Learning for Dimensionality Reduction
—In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. The resulting ...
Yen-Yu Lin, Tyng-Luh Liu, Chiou-Shann Fuh
RECOMB
2004
Springer
14 years 8 months ago
Perfect phylogeny and haplotype assignment
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
Eran Halperin, Richard M. Karp
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
14 years 1 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan