5100 search results - page 786 / 1020 » The Linear Complexity of a Graph |
137
click to vote
CSR
2010
Springer
15 years 11 months ago
2010
Springer
Algorithmic tools for graphs of small treewidth are used to address questions in complexity theory. For both arithmetic and Boolean circuits, it is shown that any circuit of size ...
223
click to vote
CEEMAS
2001
Springer
15 years 11 months ago
2001
Springer
Developing multi-agent simulations seems to be rather straight forward, as active entities in the original correspond to active agents in the model. Thus plausible behaviors can be...
200
click to vote
ICPADS
1994
IEEE
15 years 10 months ago
1994
IEEE
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
183
click to vote
SIGGRAPH
1997
ACM
15 years 10 months ago
1997
ACM
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...
180
click to vote
AAAI
2008
15 years 8 months ago
2008
In artificial intelligence and pervasive computing research, inferring users' high-level goals from activity sequences is an important task. A major challenge in goal recogni...