1469 search results - page 63 / 294 » Characterizing the Structural Complexity of Real-World Compl... |
126
Voted
CEC
2010
IEEE
15 years 4 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
123
Voted
DM
2006
15 years 3 months ago
2006
Pattern Sturmian words introduced by Kamae and Zamboni KZ1, KZ2] are an analogy of Sturmian words for the maximal pattern complexity instead of the block complexity. So far, two k...
157
click to vote
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Much recent research in human activity recognition has focused on the problem of recognizing simple repetitive (walking, running, waving) and punctual actions (sitting up...
149
click to vote
JAIR
2002
15 years 3 months ago
2002
We propose a structured approach to the problem of retrieval of images by content and present a description logic that has been devised for the semantic indexing and retrieval of ...
129
Voted
VVS
1998
IEEE
15 years 7 months ago
1998
IEEE
Although direct volume rendering is a powerful tool for visualizing complex structures within volume data, the size and complexity of the parameter space controlling the rendering...