Sciweavers

47 search results - page 8 / 10
» Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Co...
Sort
View
JASSS
2002
244views more  JASSS 2002»
13 years 7 months ago
Applications of Simulation to Social Sciences
What is the degree of sophistication that we have to put into the agents in agents based computer simulation models? Should we provide them with a "mind"? The answer ran...
Gérard Ballot, Gérard Weisbuch
JUCS
2010
106views more  JUCS 2010»
13 years 5 months ago
A Heuristic Approach to Positive Root Isolation for Multiple Power Sums
: Given a multiple power sum (extending polynomial’s exponents to real numbers), the positive root isolation problem is to find a list of disjoint intervals, satisfying that the...
Ming Xu, Chuandong Mu, Zhenbing Zeng, Zhi-bin Li
JSYML
2007
100views more  JSYML 2007»
13 years 7 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore
ICCSA
2003
Springer
14 years 16 days ago
Information Extraction to Generate Visual Simulations of Car Accidents from Written Descriptions
This paper describes a system to create animated 3D scenes of car accidents from written reports. The text-to-scene conversion process consists of two stages. An information extrac...
Pierre Nugues, Sylvain Dupuy, Arjan Egges
ICIP
2005
IEEE
14 years 9 months ago
Visual tracking via efficient kernel discriminant subspace learning
Robustly tracking moving objects in video sequences is one of the key problems in computer vision. In this paper we introduce a computationally efficient nonlinear kernel learning...
Chunhua Shen, Anton van den Hengel, Michael J. Bro...