16666 search results - page 252 / 3334 » Descriptive and Computational Complexity |
149
click to vote
ITNG
2007
IEEE
16 years 26 days ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
161
click to vote
SEMCO
2007
IEEE
16 years 26 days ago
2007
IEEE
In this paper, we present an approach which, given a knowledge base and an appropriate text corpus, automatically induces patterns which can be used to query the knowledge base. W...
194
click to vote
DEXAW
2006
IEEE
16 years 20 days ago
2006
IEEE
Detecting structural similarities between XML documents has been the subject of several recent work, and the proposed algorithms mostly use tree edit distance between the correspo...
151
click to vote
SIGGRAPH
1997
ACM
15 years 10 months ago
1997
ACM
Nonphotorealistic rendering (NPR) can help make comprehensible but simple pictures of complicated objects by employing an economy of line. But current nonphotorealistic rendering ...
175
click to vote
3DPVT
2004
IEEE
15 years 10 months ago
2004
IEEE
We present a computational framework for the inference of dense descriptions from multiple view stereo with general camera placement. Thus far research on dense multiple view ster...