Sciweavers

3131 search results - page 309 / 627
» Generalized connection caching
Sort
View
WAPCV
2007
Springer
16 years 25 days ago
Modeling the Dynamics of Feature Binding During Object-Selective Attention
We present a biologically plausible computational model for solving the visual feature binding problem. The binding problem appears to be due to the distributed nature of visual pr...
Albert L. Rothenstein, John K. Tsotsos
GLOBECOM
2006
IEEE
16 years 24 days ago
Optimal Routing in the Worst-Case-Error Metric
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
Edwin Soedarmadji
HICSS
2006
IEEE
110views Biometrics» more  HICSS 2006»
16 years 23 days ago
Flying Sinks: Heuristics for Movement in Sensor Networks
Movement in wireless and sensor environments changes the degree to which we can communicate. Whereas sensor networks are generally seen as static, in many situations there is at l...
Jeffrey V. Nickerson
209
Voted
ICALT
2006
IEEE
16 years 23 days ago
A Shortest Learning Path Selection Algorithm in E-learning
Generally speaking, in the e-learning systems, a course is modeled as a graph, where each node represents a knowledge node (KU) and two nodes are connected to form a semantic netw...
Chengling Zhao, Liyong Wan
ICRA
2006
IEEE
88views Robotics» more  ICRA 2006»
16 years 23 days ago
A Method of Cooperative Control using Occasional non-local Interactions
— Current approaches to distributed control involving many robots generally restrict interactions to pairs of robots within a threshold distance. While this allows for provable s...
Brian Shucker, Todd D. Murphey, John K. Bennett