Sciweavers

621 search results - page 84 / 125
» Global partial orders from sequential data
Sort
View
WEBDB
2005
Springer
100views Database» more  WEBDB 2005»
15 years 3 months ago
Malleable Schemas: A Preliminary Report
Large-scale information integration, and in particular, search on the World Wide Web, is pushing the limits on the combination of structured data and unstructured data. By its ver...
Xin Dong, Alon Y. Halevy
SPAA
1997
ACM
15 years 1 months ago
A Localized Algorithm for Parallel Association Mining
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, We...
PLDI
2011
ACM
14 years 17 days ago
A case for an SC-preserving compiler
The most intuitive memory consistency model for shared-memory multi-threaded programming is sequential consistency (SC). However, current concurrent programming languages support ...
Daniel Marino, Abhayendra Singh, Todd D. Millstein...
BMCBI
2004
211views more  BMCBI 2004»
14 years 9 months ago
GenomeViz: visualizing microbial genomes
Background: An increasing number of microbial genomes are being sequenced and deposited in public databases. In addition, several closely related strains are also being sequenced ...
Rohit Ghai, Torsten Hain, Trinad Chakraborty
COMPGEOM
2010
ACM
15 years 2 months ago
A kinetic triangulation scheme for moving points in the plane
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
Haim Kaplan, Natan Rubin, Micha Sharir