334 search results - page 33 / 67 » Efficient Algorithms for the Tree Homeomorphism Problem |
143
Voted
CISS
2007
IEEE
15 years 5 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
CP
2003
Springer
15 years 7 months ago
2003
Springer
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...
125
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
110
click to vote
APPINF
2003
15 years 3 months ago
2003
Discovering association rules by identifying relationships among sets of items in a transaction database is an important problem in Data Mining. Finding frequent itemsets is compu...
SIGGRAPH
2010
ACM
15 years 6 months ago
2010
ACM
Collision detection is a problem that has often been addressed efficiently with the use of hierarchical culling data structures. In the subproblem of self-collision detection for ...