Sciweavers

8695 search results - page 43 / 1739
» Making the Complex Simple
Sort
View
NAACL
2010
13 years 6 months ago
A Simple Approach for HPSG Supertagging Using Dependency Information
In a supertagging task, sequence labeling models are commonly used. But their limited ability to model long-distance information presents a bottleneck to make further improvements...
Yao-zhong Zhang, Takuya Matsuzaki, Jun-ichi Tsujii
ESANN
2006
13 years 9 months ago
OnlineDoubleMaxMinOver: a simple approximate time and information efficient online Support Vector Classification method
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
Daniel Schneegaß, Thomas Martinetz, Michael ...
PODC
1999
ACM
14 years 11 days ago
Optimal, Distributed Decision-Making: The Case of no Communication
We present a combinatorial framework for the study of a natural class of distributed optimization problems that involve decisionmaking by a collection of n distributed agents in th...
Marios Mavronicolas, Paul G. Spirakis
COCO
2001
Springer
135views Algorithms» more  COCO 2001»
14 years 16 days ago
Simple Analysis of Graph Tests for Linearity and PCP
We give a simple analysis of the PCP with low amortized query complexity of Samorodnitsky and Trevisan [16]. The analysis also applies to the linearity testing over finite field...
Johan Håstad, Avi Wigderson
SAB
2010
Springer
140views Optimization» more  SAB 2010»
13 years 6 months ago
A Model of Symmetry Breaking in Collective Decision-Making
Abstract. Symmetry breaking is commonly found in self-organized collective decision making. It serves an important functional role, specifically in biological and bio-inspired sys...
Heiko Hamann, Bernd Meyer, Thomas Schmickl, Karl C...