Sciweavers

621 search results - page 16 / 125
» An Expressive and Efficient Solution to the Service Selectio...
Sort
View
USITS
2003
14 years 11 months ago
Network-Sensitive Service Discovery
We consider the problem of network-sensitive service selection (NSSS): finding services that match a particular set of functional and network properties. Current solutions handle...
An-Cheng Huang, Peter Steenkiste
CAISE
2006
Springer
14 years 11 months ago
Resolving Underconstrained and Overconstrained Systems of Conjunctive Constraints for Service Requests
Given a service request such as scheduling an appointment or purchasing a product, it is possible that the invocation of the service results in too many solutions that all satisfy ...
Muhammed Al-Muhammed, David W. Embley
72
Voted
ICWS
2009
IEEE
15 years 6 months ago
Enabling Scaleable, Efficient, Non-visual Web Browsing Services
Over the last few decades, the discipline of Web Accessibility has been focused on building more efficient and more effective speech generators for Web Browsers. The visual browse...
Ashish Verma, Tyrone Grandison, Himanshu Chauhan
BMCBI
2010
178views more  BMCBI 2010»
14 years 9 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
ICDT
2010
ACM
205views Database» more  ICDT 2010»
15 years 2 months ago
On the Aggregation Problem for Synthesized Web Services
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
Ting Deng, Wenfei Fan, Leonid Libkin, Yinghui Wu