230 search results - page 43 / 46 » A Linear Time Algorithm for L(2, 1)-Labeling of Trees |
WISE
2009
Springer
14 years 1 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
14 years 15 days 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
14 years 5 days 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...
ICCAD
2000
IEEE
13 years 11 months ago
2000
IEEE
In this paper, we propose an approach for the analysis of power supply noise in the frequency domain for power/ground (P/G) networks of tree topologies. We model the P/G network a...
VLDB
2005
ACM
14 years 13 days 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...