Sciweavers

3280 search results - page 230 / 656
» MiTAP for real users, real data, real problems
Sort
View
ICML
2000
IEEE
16 years 7 months ago
Learning Subjective Functions with Large Margins
In manyoptimization and decision problems the objective function can be expressed as a linear combinationof competingcriteria, the weights of whichspecify the relative importanceo...
Claude-Nicolas Fiechter, Seth Rogers
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
15 years 8 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang
AUSAI
2007
Springer
16 years 24 days ago
The Detrimentality of Crossover
The traditional concept of a genetic algorithm (GA) is that of selection, crossover and mutation. However, a limited amount of data from the literature has suggested that the nich...
Andrew Czarn, Cara MacNish, Kaipillil Vijayan, Ber...
SIGMOD
2010
ACM
214views Database» more  SIGMOD 2010»
15 years 11 months ago
ParaTimer: a progress indicator for MapReduce DAGs
Time-oriented progress estimation for parallel queries is a challenging problem that has received only limited attention. In this paper, we present ParaTimer, a new type of timere...
Kristi Morton, Magdalena Balazinska, Dan Grossman
CGA
1999
15 years 6 months ago
Visualizing Large Telecommunication Data Sets
displays to abstract network data and let users interactwithit.Wehaveimplementedafull-scaleSwift3D prototype, which generated the examples we present here. Swift-3D We developed Sw...
Eleftherios Koutsofios, Stephen C. North, Daniel A...