2887 search results - page 15 / 578 » Name Generation and Linearity |
ISPAN
2002
IEEE
15 years 4 months ago
2002
IEEE
Many applications written in C allocate memory blocks for their major data structures from the heap space at runtime. The analysis of heap-oriented pointers in such programs is cr...
109
click to vote
AISS
2010
14 years 9 months ago
2010
The node selection for the migration of a mobile agent depends on the content of the referenced metadata in the naming space. The reliability of the migrated information is determ...
100
click to vote
CLEF
2010
Springer
15 years 24 days ago
2010
Springer
Abstract. This paper describes our approach to the Person Name Disambiguation clustering task in the Third Web People Search Evaluation Campaign(WePS3). The method focuses on two a...
108
click to vote
WIDM
2005
ACM
15 years 5 months ago
2005
ACM
Clustering the results of a search helps the user to overview the information returned. In this paper, we regard the clustering task as indexing the search results. Here, an index...
ENTCS
2007
14 years 11 months ago
2007
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...