Sciweavers

2127 search results - page 137 / 426
» Computing large matchings fast
Sort
View
CAISE
2004
Springer
15 years 9 months ago
Ranked Matching for Service Descriptions using DAML-S
Abstract. The vision of Semantic Web services is that computer systems shall find eligible services autonomously. This can be realised with providing semantic description about ad...
Michael C. Jaeger, Stefan Tang
167
Voted
FCCM
2004
IEEE
130views VLSI» more  FCCM 2004»
15 years 7 months ago
Hyperreconfigurable Architectures for Fast Run Time Reconfiguration
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit changing needs of a computation during run time. The increasing...
Sebastian Lange, Martin Middendorf
DAC
2007
ACM
16 years 5 months ago
Fast Second-Order Statistical Static Timing Analysis Using Parameter Dimension Reduction
The ability to account for the growing impacts of multiple process variations in modern technologies is becoming an integral part of nanometer VLSI design. Under the context of ti...
Zhuo Feng, Peng Li, Yaping Zhan
127
Voted
AAAI
2006
15 years 5 months ago
SEMAPLAN: Combining Planning with Semantic Matching to Achieve Web Service Composition
Composing existing Web services to deliver new functionality is a difficult problem as it involves resolving semantic, syntactic and structural differences among the interfaces of...
Rama Akkiraju, Biplav Srivastava, Anca-Andreea Iva...
ICMCS
2007
IEEE
188views Multimedia» more  ICMCS 2007»
15 years 10 months ago
A Fast Approach for Natural Image Matting using Structure Information
Natural image matting plays an important role in image and video editing. It has been addressed hotly because it is inherently an under-constrained problem – we must estimate bo...
Qianhui Ning, Weiqiang Wang, Caifeng Zhu, Laiyun Q...