958 search results - page 65 / 192 » Resolving the Micropayment Problem |
103
click to vote
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
SDM
2007
SIAM
14 years 11 months ago
2007
SIAM
When non-unique values are used as the identifier of entities, due to their homonym, confusion can occur. In particular, when (part of) “names” of entities are used as their ...
IJFCS
2008
14 years 10 months ago
2008
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observat...
102
click to vote
BMVC
2010
14 years 8 months ago
2010
The problems of dense stereo reconstruction and object class segmentation can both be formulated as Conditional Random Field based labelling problems, in which every pixel in the ...
IJCAI
1989
14 years 11 months ago
1989
This paper deals with a well known problem in AI planning: detecting and resolving conflicts in nonlinear plans. We sketch a theory of restricted conflict detection and resolution...