Sciweavers

1507 search results - page 273 / 302
» Separating Complexity Classes Using Structural Properties
Sort
View
ISCA
2007
IEEE
115views Hardware» more  ISCA 2007»
15 years 5 months ago
VPC prediction: reducing the cost of indirect branches via hardware-based dynamic devirtualization
Indirect branches have become increasingly common in modular programs written in modern object-oriented languages and virtualmachine based runtime systems. Unfortunately, the pred...
Hyesoon Kim, José A. Joao, Onur Mutlu, Chan...
184
Voted
ICDT
2009
ACM
248views Database» more  ICDT 2009»
15 years 11 months ago
Automatic verification of data-centric business processes
We formalize and study business process systems that are centered around "business artifacts", or simply "artifacts". This approach focuses on data records, kn...
Alin Deutsch, Richard Hull, Fabio Patrizi, Victor ...
ICDT
2010
ACM
211views Database» more  ICDT 2010»
15 years 8 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis
COCOON
2009
Springer
15 years 5 months ago
On the Generalised Character Compatibility Problem for Non-branching Character Trees
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...
Ján Manuch, Murray Patterson, Arvind Gupta
105
Voted
JODL
2000
123views more  JODL 2000»
14 years 11 months ago
On Z39.50 wrapping and description logics
Z39.50 is a client/server protocol widely used in digital libraries and museums for searching and retrieving information spread over a number of heterogeneous sources. To overcome ...
Yannis Velegrakis, Vassilis Christophides, Panos C...