4131 search results - page 350 / 827 » Compactness in Topology and Computation |
200
click to vote
CHI
2011
ACM
14 years 10 months ago
2011
ACM
Despite the tremendous popularity of social network sites both on the web and within enterprises, the relationship information they contain may be often incomplete or outdated. We...
240
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
We present a new approach to matching graphs embedded in R2 or R3 . Unlike earlier methods, our approach does not rely on the similarity of local appearance features, does not req...
190
Voted
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Copyright 2004 IEEE. Published in Conference on Computer Vision and Pattern Recognition (CVPR-2004), June 27 - July 2, 2004, Washington DC. Personal use of this material is permit...
193
click to vote
FOCS
2009
IEEE
16 years 1 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...
203
click to vote
ACRI
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. Rule 54, in Wolfram’s notation, is one of elementary yet complexly behaving one-dimensional cellular automata. The automaton supports gliders, glider guns and other non...