Sciweavers

1672 search results - page 141 / 335
» Tightness problems in the plane
Sort
View
ICML
2008
IEEE
15 years 12 months ago
Learning to classify with missing and corrupted features
After a classifier is trained using a machine learning algorithm and put to use in a real world system, it often faces noise which did not appear in the training data. Particularl...
Ofer Dekel, Ohad Shamir
STOC
2005
ACM
118views Algorithms» more  STOC 2005»
15 years 11 months ago
Euclidean distortion and the sparsest cut
We prove that every n-point metric space of negative type (and, in particular, every npoint subset of L1) embeds into a Euclidean space with distortion O( log n ? log log n), a r...
Sanjeev Arora, James R. Lee, Assaf Naor
STOC
2005
ACM
146views Algorithms» more  STOC 2005»
15 years 11 months ago
Approximation algorithms for combinatorial auctions with complement-free bidders
We exhibit three approximation algorithms for the allocation problem in combinatorial auctions with complement free bidders. The running time of these algorithms is polynomial in ...
Shahar Dobzinski, Noam Nisan, Michael Schapira
PODS
2003
ACM
151views Database» more  PODS 2003»
15 years 11 months ago
Feasible itemset distributions in data mining: theory and application
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
Ganesh Ramesh, William Maniatty, Mohammed Javeed Z...
CP
2009
Springer
15 years 6 months ago
Dialectic Search
We introduce Hegel and Fichte’s dialectic as a search meta-heuristic for constraint satisfaction and optimization. Dialectic is an appealing mental concept for local search as it...
Serdar Kadioglu, Meinolf Sellmann