Sciweavers

4037 search results - page 473 / 808
» Routing without ordering
Sort
View
KDD
2005
ACM
146views Data Mining» more  KDD 2005»
16 years 4 months ago
Anonymity-preserving data collection
Protection of privacy has become an important problem in data mining. In particular, individuals have become increasingly unwilling to share their data, frequently resulting in in...
Zhiqiang Yang, Sheng Zhong, Rebecca N. Wright
SIGMOD
2008
ACM
139views Database» more  SIGMOD 2008»
16 years 4 months ago
SQAK: doing more with keywords
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...
Sandeep Tata, Guy M. Lohman
DCC
2001
IEEE
16 years 3 months ago
LIPT: A Reversible Lossless Text Transform to Improve Compression Performance
Lossless compression researchers have developed highly sophisticated approaches, such as Huffman encoding, arithmetic encoding, the Lempel-Ziv family, Dynamic Markov Compression (D...
Fauzia S. Awan, Nan Zhang 0005, Nitin Motgi, Raja ...
MICRO
2008
IEEE
124views Hardware» more  MICRO 2008»
15 years 10 months ago
Token tenure: PATCHing token counting using directory-based cache coherence
Traditional coherence protocols present a set of difficult tradeoffs: the reliance of snoopy protocols on broadcast and ordered interconnects limits their scalability, while dire...
Arun Raghavan, Colin Blundell, Milo M. K. Martin
IEEEPACT
2006
IEEE
15 years 10 months ago
An empirical evaluation of chains of recurrences for array dependence testing
Code restructuring compilers rely heavily on program analysis techniques to automatically detect data dependences between program statements. Dependences between statement instanc...
Johnnie Birch, Robert A. van Engelen, Kyle A. Gall...