Sciweavers

AAAI
2008
14 years 7 days ago
Semi-supervised Classification Using Local and Global Regularization
In this paper, we propose a semi-supervised learning (SSL) algorithm based on local and global regularization. In the local regularization part, our algorithm constructs a regular...
Fei Wang, Tao Li, Gang Wang, Changshui Zhang
AAAI
2008
14 years 7 days ago
Studies in Solution Sampling
We introduce novel algorithms for generating random solutions from a uniform distribution over the solutions of a boolean satisfiability problem. Our algorithms operate in two pha...
Vibhav Gogate, Rina Dechter
BMVC
2002
14 years 10 days ago
Comparing Variations on the Active Appearance Model Algorithm
The Active Appearance Model (AAM) algorithm has proved to be a successful method for matching statistical models of appearance to new images. Since the original algorithm was desc...
Timothy F. Cootes, Panachit Kittipanya-ngam
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
14 years 1 months ago
The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions
Abstract. We prove asymptotically optimal bounds on the Gaussian noise sensitivity of degree-d polynomial threshold functions. These bounds translate into optimal bounds on the Gau...
Daniel M. Kane
AAIM
2010
Springer
155views Algorithms» more  AAIM 2010»
14 years 1 months ago
The (K, k)-Capacitated Spanning Tree Problem
Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that t...
Esther M. Arkin, Nili Guttmann-Beck, Refael Hassin
COCO
2010
Springer
186views Algorithms» more  COCO 2010»
14 years 1 months ago
Derandomized Parallel Repetition of Structured PCPs
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
Irit Dinur, Or Meir
ANTS
2010
Springer
241views Algorithms» more  ANTS 2010»
14 years 1 months ago
Explicit Coleman Integration for Hyperelliptic Curves
Jennifer S. Balakrishnan, Robert W. Bradshaw, Kira...
ANTS
2010
Springer
257views Algorithms» more  ANTS 2010»
14 years 1 months ago
On the Use of the Negation Map in the Pollard Rho Method
Joppe W. Bos, Thorsten Kleinjung, Arjen K. Lenstra
AAIM
2010
Springer
219views Algorithms» more  AAIM 2010»
14 years 1 months ago
Approximating Maximum Edge 2-Coloring in Simple Graphs
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...
Zhi-Zhong Chen, Sayuri Konno, Yuki Matsushita
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
14 years 1 months ago
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
Aaron Williams