Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Jean-Luc Duprat"'
Publikováno v:
Future Internet, Vol 7, Iss 2, Pp 110-139 (2015)
Quality web service discovery requires narrowing the search space from an overwhelming set of services down to the most relevant ones, while matching the consumer’s request. Today, the ranking of services only considers static attributes or snapsho
Externí odkaz:
https://doaj.org/article/9bbf4a7e80904f87a002f20b60a75ca1
Publikováno v:
Computer-Aided Design. 70:171-181
The hierarchical implicit modelling paradigm, as exemplified by the BlobTree, makes it possible to support not only Boolean operations and affine transformations, but also various forms of blending and space warping. Typically, the resulting solid is
Publikováno v:
Future Internet, Vol 7, Iss 2, Pp 110-139 (2015)
Future Internet
Volume 7
Issue 2
Pages 110-139
Future Internet
Volume 7
Issue 2
Pages 110-139
Quality web service discovery requires narrowing the search space from an overwhelming set of services down to the most relevant ones, while matching the consumer’s request. Today, the ranking of services only considers static attributes or snapsho
Autor:
Pahlevan, Atousa1 apahlevan@ieee.org, Duprat, Jean-Luc1 jld@acm.org, Thomo, Alex1 thomo@cs.uvic.ca, Müller, Hausi1 hausi@cs.uvic.ca
Publikováno v:
Future Internet. 2015, Vol. 7 Issue 2, p110-139. 30p.
Publikováno v:
ACM Computing Surveys. Jul2015, Vol. 47 Issue 4, p60:1-60:39. 39p. 10 Black and White Photographs, 3 Diagrams, 2 Charts.
Publikováno v:
2016 IEEE International Conference on Image Processing (ICIP); 2016, p355-359, 5p
Autor:
Borshukov, George, Montgomery, Jefferson, Werner, Witek, Ruff, Barry, Lau, James, Thuriot, Paul, Mooney, Patrick, Van Niekerk, Stefan, Raposo, Dave, Duprat, Jean-Luc, Hable, John, Kihlström, Håkan, Roizman, Daniel, Noone, Kevin, O'Connell, Jeff
Publikováno v:
ACM SIGGRAPH 2006 Sketches; 7/30/2006, p28-es, 1p
Publikováno v:
IEEE Transactions on Services Computing; Jan2014, Vol. 7 Issue 1, p123-125, 3p
Publikováno v:
IEEE Transactions on Services Computing; Jan2013, Vol. 6 Issue 1, p143-145, 3p