132 search results - page 9 / 27 » Regular Decompositions |
74
Voted
FCSC
2008
14 years 9 months ago
2008
Abstract. We discuss the verification of mathematical software solving polynomial systems symbolically by way of triangular decomposition. Standard verification techniques are high...
AAAI
2007
14 years 11 months ago
2007
Clustering is an old research topic in data mining and machine learning communities. Most of the traditional clustering methods can be categorized local or global ones. In this pa...
NIPS
2001
14 years 10 months ago
2001
Recent work has shown impressive transform-invariant modeling and clustering for sets of images of objects with similar appearance. We seek to expand these capabilities to sets of...
117
click to vote
FOCS
2003
IEEE
15 years 2 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
104
click to vote
EMNLP
2011
13 years 9 months ago
2011
Dual decomposition has been recently proposed as a way of combining complementary models, with a boost in predictive power. However, in cases where lightweight decompositions are ...