Sciweavers

2031 search results - page 139 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
WSC
2007
15 years 9 days ago
Composing simulation models using interface definitions based on web service descriptions
Using models in different contexts poses major integration challenges, ranging from technical to conceptual levels. Independently of each other developed model components cannot b...
Mathias Röhl, Stefan Morgenstern
EICS
2010
ACM
15 years 10 hour ago
Service discovery supported by task models
We propose an approach that takes as input a task model, which includes the user's view of the interactive system, and automatically discovers a set of categorized and ranked...
Kyriakos Kritikos, Fabio Paternò
ECML
2006
Springer
14 years 12 months ago
B-Matching for Spectral Clustering
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
Tony Jebara, Vlad Shchogolev
COCOON
2008
Springer
14 years 11 months ago
Multi-party Quantum Communication Complexity with Routed Messages
This paper describes a general quantum lower bounding technique for the communication complexity of a function that depends on the inputs given to two parties connected via paths,...
Seiichiro Tani, Masaki Nakanishi, Shigeru Yamashit...
ACL
2008
14 years 11 months ago
MAXSIM: A Maximum Similarity Metric for Machine Translation Evaluation
We propose an automatic machine translation (MT) evaluation metric that calculates a similarity score (based on precision and recall) of a pair of sentences. Unlike most metrics, ...
Yee Seng Chan, Hwee Tou Ng