Sciweavers

6104 search results - page 971 / 1221
» Constructing Information Bases Using Associative Structures
Sort
View
131
Voted
ACL
1998
15 years 5 months ago
Context Management with Topics for Spoken Dialogue Systems
In this paper we discuss the use of discourse context in spoken dialogue systems and argue that the knowledge of the domain, modelled with the help of dialogue topics is important...
Kristiina Jokinen, Hideki Tanaka
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 4 months ago
On the Computation of the Topology of a Non-Reduced Implicit Space Curve
An algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces. It computes a Piecewise ...
Daouda Niang Diatta, Bernard Mourrain, Olivier Rua...
136
Voted
COLING
2010
14 years 11 months ago
Sentiment Classification and Polarity Shifting
Polarity shifting marked by various linguistic structures has been a challenge to automatic sentiment classification. In this paper, we propose a machine learning approach to inco...
Shoushan Li, Sophia Yat Mei Lee, Ying Chen, Chu-Re...
ML
2011
ACM
179views Machine Learning» more  ML 2011»
14 years 11 months ago
Neural networks for relational learning: an experimental comparison
In the last decade, connectionist models have been proposed that can process structured information directly. These methods, which are based on the use of graphs for the representa...
Werner Uwents, Gabriele Monfardini, Hendrik Blocke...
147
Voted
IPCO
2008
118views Optimization» more  IPCO 2008»
15 years 5 months ago
Constraint Orbital Branching
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...