214 search results - page 40 / 43 » A linear time algorithm for L(2,1)-labeling of trees |
WISE
2009
Springer
15 years 4 months ago
2009
Springer
Results clustering in Web Searching is useful for providing users with overviews of the results and thus allowing them to restrict their focus to the desired parts. However, the ta...
SAC
2005
ACM
15 years 3 months ago
2005
ACM
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
CIVR
2003
Springer
15 years 3 months ago
2003
Springer
Feature selection for video retrieval applications is impractical with existing techniques, because of their high time complexity and their failure on the relatively sparse trainin...
VLDB
2005
ACM
15 years 3 months ago
2005
ACM
Summarization of query results is an important problem for many OLAP applications. The Minimum Description Length principle has been applied in various studies to provide summarie...
APIN
2008
14 years 10 months ago
2008
Abstract-Mining generalized association rules between items in the presence of taxonomy has been recognized as an important model in data mining. Earlier work on mining generalized...