5401 search results - page 1047 / 1081 » Using Versions in GIS |
136
click to vote
SODA
1997
ACM
15 years 3 months ago
1997
ACM
Given two planar polylines T and P with n and m edges, respectively, we present an O m2 n2 time, O mn space algorithm to nd portions of the text" T which are similar in sh...
118
click to vote
ACL
1994
15 years 3 months ago
1994
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
128
click to vote
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
Many applications in multiagent learning are essentially convex optimization problems in which agents have only limited communication and partial information about the function be...
154
click to vote
ECAI
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. One of the most frequently used inference services of description logic reasoners classifies all named classes of OWL ontologies into a subsumption hierarchy. Due to emer...
115
click to vote
COMAD
2009
15 years 3 months ago
2009
Keyword search on data represented as graphs, is receiving lot of attention in recent years. Initial versions of keyword search systems assumed that the graph is memory resident. ...