Sciweavers

676 search results - page 49 / 136
» Fixed-Parameter Approximation: Conceptual Framework and Appr...
Sort
View
CJ
1998
118views more  CJ 1998»
13 years 8 months ago
Least-Squares Structuring, Clustering and Data Processing Issues
Approximation structuring clustering is an extension of what is usually called square-error clustering" onto various cluster structures and data formats. It appears to be not...
Boris Mirkin
LOGCOM
2010
104views more  LOGCOM 2010»
13 years 7 months ago
Herbrand's Theorem, Skolemization and Proof Systems for First-Order Lukasiewicz Logic
Abstract. An approximate Herbrand theorem is established for firstorder infinite-valued Lukasiewicz Logic and used to obtain a proof-theoretic proof of Skolemization. These resul...
Matthias Baaz, George Metcalfe
TCS
2010
13 years 7 months ago
Randomized priority algorithms
Borodin, Nielsen and Rackoff [13] introduced the class of priority algorithms as a framework for modeling deterministic greedy-like algorithms. In this paper we address the effe...
Spyros Angelopoulos, Allan Borodin
ECCV
2006
Springer
14 years 11 months ago
Conditional Infomax Learning: An Integrated Framework for Feature Extraction and Fusion
The paper introduces a new framework for feature learning in classification motivated by information theory. We first systematically study the information structure and present a n...
Dahua Lin, Xiaoou Tang
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
14 years 2 months ago
Towards truthful mechanisms for binary demand games: a general framework
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang