Sciweavers

10891 search results - page 2177 / 2179
» Combining Model Reductions
Sort
View
PODS
2009
ACM
119views Database» more  PODS 2009»
14 years 8 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
COMPGEOM
2010
ACM
14 years 22 days ago
Orthogonal range reporting: query lower bounds, optimal structures in 3-d, and higher-dimensional improvements
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
Peyman Afshani, Lars Arge, Kasper Dalgaard Larsen
SPAA
2010
ACM
14 years 14 days ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...
ICIP
1997
IEEE
14 years 9 months ago
Image Coupling, Restoration and Enhancement via PDE's
We present a new approach based on Partial Differential Equations (PDE) to restore noisy blurred images. After studying the methods to denoise images, staying as close as possible...
Pierre Kornprobst, Rachid Deriche, Gilles Aubert
LPNMR
2005
Springer
14 years 1 months ago
Data Integration: a Challenging ASP Application
Abstract. The paper presents INFOMIX a successful application of ASP technology to the domain of Data Integration. INFOMIX is a novel system which supports powerful information int...
Nicola Leone, Thomas Eiter, Wolfgang Faber, Michae...
« Prev « First page 2177 / 2179 Last » Next »