Sciweavers

1691 search results - page 214 / 339
» Restricted subset selection
Sort
View
WWW
2008
ACM
16 years 4 months ago
Matching independent global constraints for composite web services
Service discovery employs matching techniques to select services by comparing their descriptions against user constraints. Semantic-based matching approaches achieve higher recall...
Nalaka Gooneratne, Zahir Tari
DAARC
2007
Springer
137views Algorithms» more  DAARC 2007»
15 years 10 months ago
Anaphora Resolution as Equality by Default
The resolution of anaphora is dependent on a number of factors discussed in the literature: syntactic parallelism, topicality, etc. A system that attempts to resolve anaphora will ...
Ariel Cohen
ALT
2009
Springer
16 years 28 days ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
153
Voted
ADHOCNOW
2008
Springer
15 years 10 months ago
Adapting BitTorrent to Wireless Ad Hoc Networks
Abstract. BitTorrent is one of the Internet’s most efficient content distribution protocols. It is known to perform very well over the wired Internet where end-to-end performance...
Mohamed Karim Sbai, Chadi Barakat, Jaeyoung Choi, ...
MUC
1991
15 years 7 months ago
University of Massachusetts: description of the CIRCUS system as used for MUC-3
ind this work was to extract a relatively abstract level of information from each sentence , using only a limited vocabulary that was hand-crafted to handle a restricted set of tar...
Wendy G. Lehnert, Claire Cardie, David Fisher, Ell...