Sciweavers

4926 search results - page 18 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
CONNECTION
2006
101views more  CONNECTION 2006»
13 years 7 months ago
High capacity, small world associative memory models
Models of associative memory usually have full connectivity or if diluted, random symmetric connectivity. In contrast, biological neural systems have predominantly local, non-symm...
Neil Davey, Lee Calcraft, Rod Adams
APPROX
2009
Springer
137views Algorithms» more  APPROX 2009»
14 years 2 months ago
Testing Computability by Width Two OBDDs
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
Dana Ron, Gilad Tsur
DAM
2006
172views more  DAM 2006»
13 years 7 months ago
A Branch-and-Cut algorithm for graph coloring
In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of...
Isabel Méndez-Díaz, Paula Zabala
CVPR
2012
IEEE
11 years 10 months ago
Coupling detection and data association for multiple object tracking
We present a novel framework for multiple object tracking in which the problems of object detection and data association are expressed by a single objective function. The framewor...
Zheng Wu, Ashwin Thangali, Stan Sclaroff, Margrit ...
IPPS
2002
IEEE
14 years 15 days ago
An Associative Static and Dynamic Convex Hull Algorithm
This paper presents a new static and dynamic recursive parallel algorithm for the convex hull problem. This algorithm is a parallel adaptation of the Graham Scan and Quick Hull al...
Maher M. Atwah, Johnnie W. Baker