334 search results - page 26 / 67 » Efficient Algorithms for the Tree Homeomorphism Problem |
ICDM
2010
IEEE
13 years 6 months ago
2010
IEEE
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
ISCC
2003
IEEE
14 years 1 months ago
2003
IEEE
Perfect Secrecy can only be achieved in multicast groups by ciphering data sent to the group with a different key every time a member joins or leaves the group. A Key Server must ...
ICCAD
1999
IEEE
14 years 23 days ago
1999
IEEE
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
WWW
2008
ACM
14 years 9 months ago
2008
ACM
In this paper, we study the problem of keyword proximity search over XML documents and leverage the efficiency and effectiveness. We take the disjunctive semantics among input key...
IANDC
2008
13 years 8 months ago
2008
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...