4184 search results - page 801 / 837 » Names of Our Lives |
IMC
2007
ACM
14 years 11 months ago
2007
ACM
The ability to discover network organization, whether in the form of explicit topology reconstruction or as embeddings that approximate topological distance, is a valuable tool. T...
71
Voted
ACL
2008
14 years 11 months ago
2008
We investigate the tasks of general morphological tagging, diacritization, and lemmatization for Arabic. We show that for all tasks we consider, both modeling the lexeme explicitl...
106
click to vote
DAGSTUHL
2007
14 years 11 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
84
Voted
CSC
2008
14 years 11 months ago
2008
Many applications of Mathematical Physics and Engineering are connected with the Laplacian, however, the most part of BVP relevant to the Laplacian are solved in explicit form onl...
ISEMANTICS
2010
14 years 11 months ago
2010
In this paper, when we use the term ontology, we are primarily referring to linked data in the form of RDF(S). The problem of ontology mapping has attracted considerable attention...