English
Related papers

Related papers: Cardinality heterogeneities in Web service composi…

200 papers

In modern recommender systems, both users and items are associated with rich side information, which can help understand users and items. Such information is typically heterogeneous and can be roughly categorized into flat and hierarchical…

Information Retrieval · Computer Science 2019-07-23 Tianqiao Liu , Zhiwei Wang , Jiliang Tang , Songfan Yang , Gale Yan Huang , Zitao Liu

We propose a novel approach to the problem of semantic heterogeneity where data are organized into a set of stratified and independent representation layers, namely: conceptual(where a set of unique alinguistic identifiers are connected…

Databases · Computer Science 2021-05-21 Fausto Giunchiglia , Alessio Zamboni , Mayukh Bagchi , Simone Bocca

Cardinality constrained bin packing or bin packing with cardinality constraints is a basic bin packing problem. In the online version with the parameter k \geq 2, items having sizes in (0,1] associated with them are presented one by one to…

Data Structures and Algorithms · Computer Science 2016-08-24 János Balogh , József Békési , György Dósa , Leah Epstein , Asaf Levin

The development of pervasive computing has put the light on a challenging problem: how to dynamically compose services in heterogeneous and highly changing environments? We propose a survey that defines the service composition as a sequence…

Software Engineering · Computer Science 2009-09-14 Noha Ibrahim , Frederic Le Mouel

Web services are building blocks of interoperable systems. Composing Web services makes the processes capable of doing complex tasks. Composite services may fail during their execution which can be diagnosed by a mediator. The mediator…

Software Engineering · Computer Science 2012-11-27 Hadi Saboohi , Sameem Abdul Kareem

Economic choices are often stochastic: the same person may make a different choice when facing the same alternatives repeatedly. Standard models assume that the degree of randomness reflects the size of utility differences, but choice…

Theoretical Economics · Economics 2026-05-05 Shuhua Si

In the paper, combinatorial synthesis of structure for applied Web-based systems is described. The problem is considered as a combination of selected design alternatives for system parts/components into a resultant composite decision (i.e.,…

Software Engineering · Computer Science 2011-09-05 Mark Sh. Levin

In this paper, we study the pickup and delivery problem with multiple transportation modalities, and address the challenge of efficiently allocating transportation resources while price matching users with their desired delivery modes. More…

Systems and Control · Electrical Eng. & Systems 2024-11-18 Mark Beliaev , Negar Mehr , Ramtin Pedarsani

Nowadays, journalism is facilitated by the existence of large amounts of digital data sources, including many Open Data ones. Such data sources are extremely heterogeneous, ranging from highly struc-tured (relational databases),…

In this paper we address cardinality estimation problem which is an important subproblem in query optimization. Query optimization is a part of every relational DBMS responsible for finding the best way of the execution for the given query.…

Databases · Computer Science 2017-11-23 Oleg Ivanov , Sergey Bartunov

Formal reasoning about finite sets and cardinality is an important tool for many applications, including software verification, where very often one needs to reason about the size of a given data structure and not only about what its…

Logic in Computer Science · Computer Science 2021-10-06 Maximiliano Cristiá , Gianfranco Rossi

This paper introduces a novel decomposition framework to explain heterogeneity in causal effects observed across different studies, considering both observational and randomized settings. We present a formal decomposition of between-study…

Methodology · Statistics 2025-12-18 Brian Gilbert , Ivan Dıaz , Kara E. Rudolph , Nicholas Williams , Tat-Thang Vo

The internet is considered as the most extensive market in the world. To keep its gradual reputation, it must confront real problems that result from its distribution and from the diversity of the protocols used to insure communications.…

Information Retrieval · Computer Science 2015-01-27 J. Boutahar , T. Rachad , S. El ghazi

Consistent Query Answering (CQA) is the problem of computing from a database the answers to a query that are consistent with respect to certain integrity constraints that the database, as a whole, may fail to satisfy. Consistent answers…

Databases · Computer Science 2007-05-23 Andrei Lopatenko , Leopoldo Bertossi

This article covers the problem of processing of Big Data that describe process of complex networks and network systems operation. It also introduces the notion of hierarchical network systems combination into associations and conglomerates…

Data Analysis, Statistics and Probability · Physics 2016-03-28 Olexandr Polishchuk , Dmytro Polishchuk , Maria Tyutyunnyk , Mykhailo Yadzhak

Datasets with a mixture of numerical and categorical attributes are routinely encountered in many application domains. In this work we examine an approach to clustering such datasets using homogeneity analysis. Homogeneity analysis…

Machine Learning · Statistics 2017-10-31 Rajiv Sambasivan , Sourish Das

Heterogeneous computing is widely used at all levels of computing from data center to edge due to its power/performance characteristics. However, heterogeneity presents challenges. Interoperability---the management of workloads across…

Software Engineering · Computer Science 2020-05-19 Shuvra S. Bhattacharyya , Marilyn C. Wolf

In systems biology, it is becoming increasingly common to measure biochemical entities at different levels of the same biological system. Hence, data fusion problems are abundant in the life sciences. With the availability of a multitude of…

We study the submodular secretary problem with a cardinality constraint. In this problem, $n$ candidates for secretaries appear sequentially in random order. At the arrival of each candidate, a decision maker must irrevocably decide whether…

Data Structures and Algorithms · Computer Science 2019-05-14 Kaito Fujii

This paper proves that arrangement of music is NP-hard when subject to various constraints: avoiding musical dissonance, limiting how many notes can be played simultaneously, and limiting transition speed between chords. These results imply…

Computational Complexity · Computer Science 2016-07-15 William S. Moses , Erik D. Demaine
‹ Prev 1 3 4 5 6 7 10 Next ›