Sciweavers

298 search results - page 28 / 60
» Competitive Analysis of Flash-Memory Algorithms
Sort
View
KDD
2004
ACM
103views Data Mining» more  KDD 2004»
15 years 10 months ago
An objective evaluation criterion for clustering
We propose and test an objective criterion for evaluation of clustering performance: How well does a clustering algorithm run on unlabeled data aid a classification algorithm? The...
Arindam Banerjee, John Langford
DAC
2008
ACM
15 years 11 months ago
Parameterized timing analysis with general delay models and arbitrary variation sources
Many recent techniques for timing analysis under variability, in which delay is an explicit function of underlying parameters, may be described as parameterized timing analysis. T...
Khaled R. Heloue, Farid N. Najm
CLEF
2007
Springer
15 years 4 months ago
Simple Morpheme Labelling in Unsupervised Morpheme Analysis
This paper presents my participation to the second Morpho Challenge. Results have been obtained with the algorithm already presented at Morpho Challenge 2005. The system takes a p...
Delphine Bernhard
SIGECOM
2004
ACM
165views ECommerce» more  SIGECOM 2004»
15 years 3 months ago
Adaptive limited-supply online auctions
We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Da...
CIKM
2010
Springer
14 years 8 months ago
Fast dimension reduction for document classification based on imprecise spectrum analysis
This paper proposes an algorithm called Imprecise Spectrum Analysis (ISA) to carry out fast dimension reduction for document classification. ISA is designed based on the one-sided...
Hu Guan, Bin Xiao, Jingyu Zhou, Minyi Guo, Tao Yan...