Sciweavers

9405 search results - page 988 / 1881
» Computing a Model of Set Theory
Sort
View
PODS
2008
ACM
123views Database» more  PODS 2008»
16 years 7 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
PODS
2008
ACM
158views Database» more  PODS 2008»
16 years 7 months ago
Local Hoare reasoning about DOM
The W3C Document Object Model (DOM) specifies an XML update library. DOM is written in English, and is therefore not compositional and not complete. We provide a first step toward...
Philippa Gardner, Gareth Smith, Mark J. Wheelhouse...
ICDE
2010
IEEE
249views Database» more  ICDE 2010»
16 years 2 months ago
PARINET: A tunable access method for in-network trajectories
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, ...
HICSS
2009
IEEE
130views Biometrics» more  HICSS 2009»
16 years 2 months ago
Are There Contagion Effects in the Diffusion of IT Outsourcing?
Growth in the IT outsourcing industry during the past ten years has been exceptional. In this study, we theorize about and analyze the growth patterns of IT outsourcing at the leve...
Kunsoo Han, Robert J. Kauffman, Arti Mann, Barrie ...
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
16 years 2 months ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin