Sciweavers

6540 search results - page 304 / 1308
» Data Stream Sharing
Sort
View
PODS
2006
ACM
95views Database» more  PODS 2006»
16 years 6 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...
MOBIDE
2006
ACM
16 years 19 days ago
Towards correcting input data errors probabilistically using integrity constraints
Mobile and pervasive applications frequently rely on devices such as RFID antennas or sensors (light, temperature, motion) to provide them information about the physical world. Th...
Nodira Khoussainova, Magdalena Balazinska, Dan Suc...
189
Voted
AUSDM
2008
Springer
235views Data Mining» more  AUSDM 2008»
15 years 8 months ago
ShrFP-Tree: An Efficient Tree Structure for Mining Share-Frequent Patterns
Share-frequent pattern mining discovers more useful and realistic knowledge from database compared to the traditional frequent pattern mining by considering the non-binary frequen...
Chowdhury Farhan Ahmed, Syed Khairuzzaman Tanbeer,...
DSS
2008
110views more  DSS 2008»
15 years 6 months ago
Evaluating ontology mapping techniques: An experiment in public safety information sharing
The public safety community in the United States consists of thousands of local, state, and federal agencies, each with its own information system. In the past few years, there ha...
Siddharth Kaza, Hsinchun Chen
HASKELL
2009
ACM
16 years 1 months ago
Type-safe observable sharing in Haskell
Haskell is a great language for writing and supporting embedded Domain Specific Languages (DSLs). Some form of observable sharing is often a critical capability for allowing so-c...
Andy Gill