451 search results - page 63 / 91 » On Parameterized Exponential Time Complexity |
ICDE
2008
IEEE
14 years 11 months ago
2008
IEEE
This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
ICPADS
2008
IEEE
14 years 4 months ago
2008
IEEE
The resolution of combinatorial assortments of protein sequences into domains is a prerequisite for protein sequence interpretation. However the recognition and clustering of homo...
FOCS
2007
IEEE
14 years 4 months ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
IPPS
2006
IEEE
14 years 4 months ago
2006
IEEE
Applications for constrained embedded systems are subject to strict time constraints and restrictive resource utilization. With soft core processors, application developers can cu...
ICCAD
1996
IEEE
14 years 2 months ago
1996
IEEE
We presenta new representationfor Boolean functions called PartitionedROBDDs. In this representation we divide the Boolean space into `k' partitions and represent a function ...