Sciweavers

2383 search results - page 171 / 477
» Finding Representative Set from Massive Data
Sort
View
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
16 years 4 months ago
Efficient Query Reformulation in Peer-Data Management Systems
Peer data management systems (PDMS) offer a flexible architecture for decentralized data sharing. In a PDMS, every peer is associated with a schema that represents the peer's...
Igor Tatarinov, Alon Y. Halevy
GFKL
2007
Springer
148views Data Mining» more  GFKL 2007»
15 years 10 months ago
Information Integration of Partially Labeled Data
Abstract. A central task when integrating data from different sources is to detect identical items. For example, price comparison websites have to identify offers for identical p...
Steffen Rendle, Lars Schmidt-Thieme
ACMACE
2006
ACM
15 years 10 months ago
Wireless home entertainment center: reducing last hop delays for real-time applications
Future digital entertainment services available to home users will share several characteristics: i) they will be deployed and delivered through the Internet, ii) a single media c...
Claudio E. Palazzi, Giovanni Pau, Marco Roccetti, ...
LCPC
1995
Springer
15 years 8 months ago
V-cal: A Calculus for the Compilation of Data Parallel Languages
V-cal is a calculus designed to support the compilation of data parallel languages that allows to describe program transformations and optimizations as semantics preserving rewrite...
P. F. G. Dechering, J. A. Trescher, J. P. M. de Vr...
XIMEP
2005
ACM
121views Database» more  XIMEP 2005»
15 years 10 months ago
Adaptive XML Storage or The Importance of Being Lazy
Building an XML store means finding solutions to the problems of representing, accessing, querying and updating XML data. The irregularity of both the structure and usage of XML, ...
Cristian Duda, Donald Kossmann