Sciweavers

607 search results - page 37 / 122
» Unifying Exact Completions
Sort
View
WWW
2004
ACM
15 years 11 months ago
Type based service composition
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
Ion Constantinescu, Boi Faltings, Walter Binder
CP
2007
Springer
15 years 5 months ago
Scheduling Conditional Task Graphs
The increasing levels of system integration in Multi-Processor System-on-Chips (MPSoCs) emphasize the need for new design flows for efficient mapping of multi-task applications o...
Michele Lombardi, Michela Milano
WAOA
2005
Springer
161views Algorithms» more  WAOA 2005»
15 years 4 months ago
"Almost Stable" Matchings in the Roommates Problem
An instance of the classical Stable Roommates problem (sr) need not admit a stable matching. This motivates the problem of finding a matching that is “as stable as possible”, ...
David J. Abraham, Péter Biró, David ...
ICDT
2001
ACM
162views Database» more  ICDT 2001»
15 years 3 months ago
Algebraic Rewritings for Optimizing Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in query optimization, data integration, data warehousing etc. Query rewriting in relational databases ...
Gösta Grahne, Alex Thomo
CORR
2010
Springer
189views Education» more  CORR 2010»
14 years 9 months ago
Robust PCA via Outlier Pursuit
Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it ...
Huan Xu, Constantine Caramanis, Sujay Sanghavi