Sciweavers

2774 search results - page 178 / 555
» Exploiting Deep Structure
Sort
View
IPCO
1996
89views Optimization» more  IPCO 1996»
15 years 7 months ago
On Dependent Randomized Rounding Algorithms
In recent years, approximation algorithms based on randomized rounding of fractional optimal solutions have been applied to several classes of discrete optimization problems. In t...
Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra
NIPS
1994
15 years 7 months ago
An Input Output HMM Architecture
We introduce a recurrent architecture having a modular structure and we formulate a training procedure based on the EM algorithm. The resulting model has similarities to hidden Ma...
Yoshua Bengio, Paolo Frasconi
ENTCS
2006
119views more  ENTCS 2006»
15 years 6 months ago
Syntax-driven Behavior Partitioning for Model-checking of Esterel Programs
We consider the issue of exploiting the structural form of ESTEREL programs to partition the algorithmic RSS (reachable state space) fix-point construction used in model-checking t...
Eric Vecchié, Robert de Simone
CORR
2002
Springer
95views Education» more  CORR 2002»
15 years 6 months ago
An Integrated Framework for Treebanks and Multilayer Annotations
Treebank formats and associated software tools are proliferating rapidly, with little consideration for interoperability. We survey a wide variety of treebank structures and opera...
Scott Cotton, Steven Bird
ML
2010
ACM
142views Machine Learning» more  ML 2010»
15 years 5 months ago
Graph regularization methods for Web spam detection
We present an algorithm, witch, that learns to detect spam hosts or pages on the Web. Unlike most other approaches, it simultaneously exploits the structure of the Web graph as wel...
Jacob Abernethy, Olivier Chapelle, Carlos Castillo