Sciweavers

10293 search results - page 325 / 2059
» Describing Semistructured Data
Sort
View
WWW
2009
ACM
16 years 7 months ago
idMesh: graph-based disambiguation of linked data
We tackle the problem of disambiguating entities on the Web. We propose a user-driven scheme where graphs of entities ? represented by globally identifiable declarative artifacts ...
Hermann de Meer, Karl Aberer, Michael Jost, Parisa...
HPCA
2003
IEEE
16 years 7 months ago
Dynamic Data Dependence Tracking and its Application to Branch Prediction
To continue to improve processor performance, microarchitects seek to increase the effective instruction level parallelism (ILP) that can be exploited in applications. A fundament...
Lei Chen, Steve Dropsho, David H. Albonesi
POPL
2008
ACM
16 years 7 months ago
Lightweight semiformal time complexity analysis for purely functional data structures
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
Nils Anders Danielsson
SIGMOD
2007
ACM
164views Database» more  SIGMOD 2007»
16 years 6 months ago
Fast data stream algorithms using associative memories
The primary goal of data stream research is to develop space and time efficient solutions for answering continuous online summarization queries. Research efforts over the last dec...
Nagender Bandi, Ahmed Metwally, Divyakant Agrawal,...
SIGMOD
2004
ACM
127views Database» more  SIGMOD 2004»
16 years 6 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