731 search results - page 111 / 147 » Reductions to Graph Isomorphism |
SDM
2008
SIAM
13 years 10 months ago
2008
SIAM
Multiple view data, which have multiple representations from different feature spaces or graph spaces, arise in various data mining applications such as information retrieval, bio...
ECCV
2002
Springer
14 years 10 months ago
2002
Springer
This paper examines issues arising in applying a previously developed edit-distance shock graph matching technique to indexing into large shape databases. This approach compares th...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
ICDCS
2006
IEEE
14 years 2 months ago
2006
IEEE
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...