Sciweavers

492 search results - page 50 / 99
» The number of possibilities for random dating
Sort
View
ECML
2004
Springer
14 years 2 months ago
The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
Marco Saerens, François Fouss, Luh Yen, Pie...
EUROCAST
1997
Springer
156views Hardware» more  EUROCAST 1997»
14 years 25 days ago
A Computational Model for Visual Size, Location and Movement
The ability to detect object size, location and movement is essential for a visual system in either a biological or man made environment. In this paper we present a model for esti...
Miguel Alemán-Flores, K. Nicholas Leibovic,...
ATAL
2009
Springer
14 years 3 months ago
Computational aspects of Shapley's saddles
Game-theoretic solution concepts, such as Nash equilibrium, are playing an ever increasing role in the study of systems of autonomous computational agents. A common criticism of N...
Felix Brandt, Markus Brill, Felix A. Fischer, Paul...
ICIP
1999
IEEE
14 years 1 months ago
Motion Segmentation with Level Sets
Segmentation of motion in an image sequence is one of the most challenging problems in image processing, while at the same time one that finds numerous applications. To date, a wea...
Abdol-Reza Mansouri, Janusz Konrad
AIPS
2009
13 years 9 months ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...