1247 search results - page 132 / 250 » A Generalization of Jumps and Labels |
SIGIR
2005
ACM
14 years 4 months ago
2005
ACM
This paper presents an algorithm for unsupervised noun sense induction, based on clustering of Web search results. The algorithm does not utilize labeled training instances or any...
SPAA
2005
ACM
14 years 4 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
FCT
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. We investigate bottom-up and top-down deterministic automata on unranked trees. We show that for an appropriate definition of bottom-up deterministic automata it is poss...
MFCS
2005
Springer
14 years 4 months ago
2005
Springer
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
OTM
2005
Springer
14 years 4 months ago
2005
Springer
We view match as an operator that takes two graph-like structures (e.g., XML schemas) and produces a mapping between the nodes of these graphs that correspond semantically to each ...