484 search results - page 70 / 97 » Computing Hilbert Class Polynomials |
ICDT
2010
ACM
13 years 6 months ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
ICDE
2009
IEEE
14 years 9 months ago
2009
IEEE
Temporal data analysis in data warehouses and data streaming systems often uses time decay to reduce the importance of older tuples, without eliminating their influence, on the res...
COLT
2006
Springer
13 years 11 months ago
2006
Springer
We describe a new approach for understanding the difficulty of designing efficient learning algorithms. We prove that the existence of an efficient learning algorithm for a circui...
PODS
2012
ACM
11 years 10 months ago
2012
ACM
Data is increasingly being bought and sold online, and Webbased marketplace services have emerged to facilitate these activities. However, current mechanisms for pricing data are ...
CONCUR
2009
Springer
14 years 2 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...