Sciweavers

5889 search results - page 986 / 1178
» Graph Layout Problems
Sort
View
NIPS
2001
15 years 3 months ago
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...
Mikhail Belkin, Partha Niyogi
STOC
2010
ACM
181views Algorithms» more  STOC 2010»
15 years 2 months ago
Load balancing and orientability thresholds for random hypergraphs
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
Pu Gao, Nicholas C. Wormald
AI
2008
Springer
15 years 2 months ago
An approach to efficient planning with numerical fluents and multi-criteria plan quality
Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, an...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
ENTCS
2006
183views more  ENTCS 2006»
15 years 2 months ago
Metamodel-Based Model Transformation with Aspect-Oriented Constraints
Model transformation means converting an input model available at the beginning of the transformation process to an output model. A widely used approach to model transformation us...
László Lengyel, Tihamer Levendovszky...
JCSS
2000
121views more  JCSS 2000»
15 years 2 months ago
The Closure of Monadic NP
It is a well-known result of Fagin that the complexity class NP coincides with the class of problems expressible in existential second-order logic ( 1 1), which allows sentences c...
Miklós Ajtai, Ronald Fagin, Larry J. Stockm...