Sciweavers

1015 search results - page 195 / 203
» An efficient algorithm for AS path inferring
Sort
View
STOC
2010
ACM
200views Algorithms» more  STOC 2010»
14 years 5 months ago
Hardness Amplification in Proof Complexity
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
Paul Beame, Trinh Huynh and Toniann Pitassi
WWW
2009
ACM
14 years 8 months ago
Smart Miner: a new framework for mining large scale web usage data
In this paper, we propose a novel framework called SmartMiner for web usage mining problem which uses link information for producing accurate user sessions and frequent navigation...
Murat Ali Bayir, Ismail Hakki Toroslu, Ahmet Cosar...
KDD
2007
ACM
191views Data Mining» more  KDD 2007»
14 years 8 months ago
Privacy-Preserving Data Mining through Knowledge Model Sharing
Privacy-preserving data mining (PPDM) is an important topic to both industry and academia. In general there are two approaches to tackling PPDM, one is statistics-based and the oth...
Patrick Sharkey, Hongwei Tian, Weining Zhang, Shou...
ACMSE
2004
ACM
14 years 1 months ago
Trust based adaptive on demand ad hoc routing protocol
In this paper, we propose a routing protocol that is based on securing the routing information from unauthorized users. Even though routing protocols of this category are already ...
Rajiv K. Nekkanti, Chung-wei Lee
FPGA
2000
ACM
141views FPGA» more  FPGA 2000»
13 years 11 months ago
Tolerating operational faults in cluster-based FPGAs
In recent years the application space of reconfigurable devices has grown to include many platforms with a strong need for fault tolerance. While these systems frequently contain ...
Vijay Lakamraju, Russell Tessier