10608 search results - page 570 / 2122 » Complexity of O'Hara's Algorithm |
221
click to vote
FOCS
2002
IEEE
16 years 2 days ago
2002
IEEE
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...
175
click to vote
VISUALIZATION
2000
IEEE
15 years 11 months ago
2000
IEEE
: We present an algorithm for haptic display of moderately complex polygonal models with a six degree of freedom (DOF) force feedback device. We make use of incremental algorithms ...
182
click to vote
COMPGEOM
1997
ACM
15 years 11 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
150
click to vote
UAI
2004
15 years 8 months ago
2004
The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subs...
207
click to vote
NETWORKING
2000
15 years 8 months ago
2000
Abstract. The design of survivable mesh based STM networks has received considerable attention in recent years and is a complex multiconstraint optimization problem. In this paper,...