6409 search results - page 457 / 1282 » A Computational Algorithm for Origami Design |
183
click to vote
CIE
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
160
click to vote
DIS
2006
Springer
15 years 10 months ago
2006
Springer
In this paper, we introduce a sectorial episode of the form C r, where C is a set of events and r is an event. The sectorial episode C r means that every event of C is followed b...
172
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
The Earth Mover Distance (EMD) between two equalsize sets of points in Rd is defined to be the minimum cost of a bipartite matching between the two pointsets. It is a natural metr...
175
click to vote
JSC
2008
15 years 6 months ago
2008
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
182
click to vote
SOCA
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--Workflow design, mashup configuration, and composite service formation are examples where the capabilities of multiple simple services combined achieve a complex function...