2080 search results - page 108 / 416 » Measuring empirical computational complexity |
145
click to vote
CIE
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
126
click to vote
BMCV
2000
Springer
15 years 8 months ago
2000
Springer
First IEEE International Workshop on Biologically Motivated Computer Vision, Seoul, Korea (May 2000). There is considerable evidence that object recognition in primates is based o...
144
click to vote
ISCIS
2005
Springer
15 years 9 months ago
2005
Springer
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
141
click to vote
CLOUD
2010
ACM
15 years 9 months ago
2010
ACM
Batched stream processing is a new distributed data processing paradigm that models recurring batch computations on incrementally bulk-appended data streams. The model is inspired...
139
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Computational Game Theory is a way to study and evaluate behaviors using game theory models, via agent-based computer simulations. One of the most known example of this a...