6274 search results - page 891 / 1255 » From query complexity to computational complexity |
224
click to vote
TOG
2012
13 years 10 months ago
2012
ike abstraction of the yarn model; (c) then, we specify the desired knitting pattern over the stitch mesh’s surface. (d) Following the interactive modeling process, the model goe...
248
Voted
CVPR
2012
IEEE
13 years 10 months ago
2012
IEEE
In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo se...
202
Voted
COCO
2009
Springer
16 years 2 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
249
Voted
MHCI
2009
Springer
16 years 2 months ago
2009
Springer
Information empowers those who make sense from its successful interpretation; this is especially true on the subject of weather where the recipient is required to have prior forms...
212
click to vote
IPPS
1997
IEEE
15 years 11 months ago
1997
IEEE
In this paper we show the power of sampling techniques in designing efficient distributed algorithms. In particular, we show that using sampling techniques, on some networks, sele...