Sciweavers

997 search results - page 23 / 200
» Completely Lazy Learning
Sort
View
SIGKDD
2010
151views more  SIGKDD 2010»
13 years 4 months ago
Limitations of matrix completion via trace norm minimization
In recent years, compressive sensing attracts intensive attentions in the field of statistics, automatic control, data mining and machine learning. It assumes the sparsity of the ...
Xiaoxiao Shi, Philip S. Yu
TCC
2010
Springer
169views Cryptology» more  TCC 2010»
14 years 6 months ago
On Complete Primitives for Fairness
Abstract. For secure two-party and multi-party computation with abort, classification of which primitives are complete has been extensively studied in the literature. However, for...
S. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostr...
TASLP
2010
138views more  TASLP 2010»
13 years 4 months ago
Glimpsing IVA: A Framework for Overcomplete/Complete/Undercomplete Convolutive Source Separation
Abstract--Independent vector analysis (IVA) is a method for separating convolutedly mixed signals that significantly reduces the occurrence of the well-known permutation problem in...
Alireza Masnadi-Shirazi, Wenyi Zhang, Bhaskar D. R...
EMNLP
2009
13 years 7 months ago
Toward Completeness in Concept Extraction and Classification
Many algorithms extract terms from text together with some kind of taxonomic classification (is-a) link. However, the general approaches used today, and specifically the methods o...
Eduard H. Hovy, Zornitsa Kozareva, Ellen Riloff
SAT
2007
Springer
121views Hardware» more  SAT 2007»
14 years 4 months ago
MiniMaxSat: A New Weighted Max-SAT Solver
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that incorporates the best SAT and Max-SAT techniques. It can handle hard clauses (clauses of mandatory satisfaction as ...
Federico Heras, Javier Larrosa, Albert Oliveras