Sciweavers

6251 search results - page 1104 / 1251
» Randomness, Computability, and Density
Sort
View
ECCV
2010
Springer
15 years 7 months ago
Automatic Learning of Background Semantics in Generic Surveilled Scenes
Advanced surveillance systems for behavior recognition in outdoor traffic scenes depend strongly on the particular configuration of the scenario. Scene-independent trajectory analy...
Carles Fernández, Jordi Gonzàlez, Xavier Roca
DAM
2000
137views more  DAM 2000»
15 years 3 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
CORR
2002
Springer
159views Education» more  CORR 2002»
15 years 3 months ago
Complexity of Mechanism Design
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism de...
Vincent Conitzer, Tuomas Sandholm
143
Voted
IJAIT
2000
142views more  IJAIT 2000»
15 years 3 months ago
Adequacy of Limited Testing for Knowledge Based Systems
Knowledge-based engineering and computational intelligence are expected to become core technologies in the design and manufacturing for the next generation of space exploration mi...
Tim Menzies, Bojan Cukic
135
Voted
NN
2000
Springer
177views Neural Networks» more  NN 2000»
15 years 3 months ago
Independent component analysis: algorithms and applications
A fundamental problem in neural network research, as well as in many other disciplines, is finding a suitable representation of multivariate data, i.e. random vectors. For reasons...
Aapo Hyvärinen, Erkki Oja
« Prev « First page 1104 / 1251 Last » Next »