5022 search results - page 111 / 1005 » Data structures and problem solving using Java |
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
AAAI
2007
15 years 7 days ago
2007
Extensional (table) constraints are an important tool for attacking combinatorial problems with constraint programming. Recently there has been renewed interest in fast propagatio...
AAAI
1996
14 years 11 months ago
1996
Many learning systems suffer from the utility problem; that is, that time after learning is greater than time before learning. Discovering how to assure that learned knowledge wil...
266
click to vote
ICA
2012
Springer
13 years 5 months ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
106
click to vote
EMNLP
2011
13 years 9 months ago
2011
In this paper, we consider the problem of unsupervised morphological analysis from a new angle. Past work has endeavored to design unsupervised learning methods which explicitly o...