1289 search results - page 256 / 258 » Complexity of Counting the Optimal Solutions |
SIAMCOMP
2002
14 years 9 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
103
click to vote
TELSYS
2002
14 years 9 months ago
2002
Native multicast routing protocols have been built and deployed using two basic types of trees: singlesource, shortest-path trees and shared, core-based trees. Core-based multicas...
SAC
2008
ACM
14 years 9 months ago
2008
ACM
In recent years role-based access control (RBAC) has been spreading within organizations. However, companies still have considerable difficulty migrating to this model, due to the...
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
—In IEEE 802.22 Wireless Regional Area Networks (WRANs), each Base Station (BS) solves a complex resource allocation problem of simultaneously determining the channel to reuse, p...
104
click to vote
SIGMOD
2010
ACM
14 years 8 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...