2778 search results - page 461 / 556 » Limit complexities revisited |
421
click to vote
ICA
2012
Springer
14 years 1 months ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
183
click to vote
TOG
2012
13 years 8 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...
205
click to vote
CVPR
2012
IEEE
13 years 8 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
click to vote
WWW
2003
ACM
16 years 7 months ago
2003
ACM
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
293
click to vote
Book
"The documentation is missing or obsolete, and the original developers have departed. Your team has limited understanding of the system, and unit tests are missing for many, i...