1538 search results - page 126 / 308 » Spectral Techniques in Graph Algorithms |
CVPR
2005
IEEE
16 years 3 months ago
2005
IEEE
Illumination changes are a ubiquitous problem in computer vision. They present a challenge in many applications, including tracking: for example, an object may move in and out of ...
KDD
2004
ACM
16 years 1 months ago
2004
ACM
Existing data mining algorithms on graphs look for nodes satisfying specific properties, such as specific notions of structural similarity or specific measures of link-based impor...
102
click to vote
ASPDAC
2004
ACM
15 years 7 months ago
2004
ACM
--Octilinear interconnect is a promising technique to shorten wire lengths. We present two practical heuristic octilinear Steiner tree (OSMT) algorithms in the paper. They are both...
IJCAI
2001
15 years 2 months ago
2001
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
107
click to vote
ICML
2005
IEEE
16 years 2 months ago
2005
IEEE
This paper presents a novel framework called proto-reinforcement learning (PRL), based on a mathematical model of a proto-value function: these are task-independent basis function...