Sciweavers

2631 search results - page 436 / 527
» A Practical Method for the Sparse Resultant
Sort
View
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
13 years 10 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
COLING
1996
13 years 10 months ago
Learning Dependencies between Case Frame Slots
We address the problem of automatically acquiring case frame patterns (selectional patterns) from large corpus data. In particular, we l)ropose a method of learning dependencies b...
Hang Li, Naoki Abe
NIPS
1993
13 years 10 months ago
The Power of Amnesia
We propose a learning algorithm for a variable memory length Markov process. Human communication, whether given as text, handwriting, or speech, has multi characteristic time scal...
Dana Ron, Yoram Singer, Naftali Tishby
ANLP
1992
89views more  ANLP 1992»
13 years 10 months ago
Computational Lexicons: the Neat Examples and the Odd Exemplars
When implementing computational lexicons it is important to keep in mind the texts that a NLP system must deal with. Words relate to each other in many different, often queer, way...
Roberto Basili, Maria Teresa Pazienza, Paola Velar...
ATAL
2010
Springer
13 years 10 months ago
Point-based backup for decentralized POMDPs: complexity and new algorithms
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...
Akshat Kumar, Shlomo Zilberstein