2766 search results - page 225 / 554 » Algorithms for trigonometric polynomials |
138
click to vote
SIAMDM
2008
15 years 5 months ago
2008
A hypergraph pair is a pair (G, H) where G and H are hypergraphs on the same set of vertices. We extend the definitions of hypertree-width [7] and generalised hypertree-width [8] ...
186
click to vote
JAIR
2002
15 years 5 months ago
2002
In this paper, we analyze the decision version of the NK landscape model from the perspective of threshold phenomena and phase transitions under two random distributions, the unif...
150
Voted
JSC
2010
15 years 3 months ago
2010
We prove two versions of Stickelberger’s Theorem for positive dimensions and use them to compute the connected and irreducible components of a complex algebraic variety. If the ...
136
click to vote
ICRA
2010
IEEE
15 years 3 months ago
2010
IEEE
To build autonomous robots capable to plan and control tasks in human environments, we need a description of trajectories that allows the robot to reason on his moves. In this pape...
164
click to vote
MST
2011
15 years 8 days ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...