26 search results - page 3 / 6 » Computing Betti Numbers via Combinatorial Laplacians |
STACS
2010
Springer
14 years 22 days ago
2010
Springer
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...
TVCG
2012
11 years 8 months ago
2012
—Morse decomposition provides a numerically stable topological representation of vector fields that is crucial for their rigorous interpretation. However, Morse decomposition is ...
IJCNN
2006
IEEE
13 years 11 months ago
2006
IEEE
— A key step in many statistical learning methods used in machine learning involves solving a convex optimization problem containing one or more hyper-parameters that must be sel...
FOCS
2005
IEEE
13 years 11 months ago
2005
IEEE
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...