Sciweavers

1374 search results - page 248 / 275
» An information theoretic approach to processing management
Sort
View
WSDM
2009
ACM
104views Data Mining» more  WSDM 2009»
15 years 4 months ago
Top-k aggregation using intersections of ranked inputs
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
Ravi Kumar, Kunal Punera, Torsten Suel, Sergei Vas...
SIGCOMM
2009
ACM
15 years 4 months ago
SMS-based contextual web search
SMS-based web search is different from traditional web search in that the final response to a search query is limited to a very small number of bytes (typically 1-2 SMS messages...
Jay Chen, Brendan Linn, Lakshminarayanan Subramani...
JTAER
2007
160views more  JTAER 2007»
14 years 9 months ago
Enabling Knowledge Sharing within e-Government Back-Office Through Ontological Engineering
Nowadays, organizational innovation constitutes the government challenges for providing better and more efficient services to citizens, enterprises or other public offices. E–go...
Graciela Brusa, María Laura Caliusco, Omar ...
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
15 years 10 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald
CHES
2005
Springer
111views Cryptology» more  CHES 2005»
15 years 3 months ago
Security Limits for Compromising Emanations
Nearly half a century ago, military organizations introduced “Tempest” emission-security test standards to control information leakage from unintentional electromagnetic emanat...
Markus G. Kuhn