Sciweavers

524 search results - page 101 / 105
» Two efficient methods to reduce power and testing time
Sort
View
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 7 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han
CCS
2010
ACM
13 years 7 months ago
Dialog-based payload aggregation for intrusion detection
Network-based Intrusion Detection Systems (IDSs) such as Snort or Bro that have to analyze the packet payload for all the received data show severe performance problems if used in...
Tobias Limmer, Falko Dressler
CEC
2010
IEEE
13 years 8 months ago
Constrained global optimization of low-thrust interplanetary trajectories
The optimization of spacecraft trajectories can be formulated as a global optimization task. The complexity of the problem depends greatly on the problem formulation, on the spacec...
Chit Hong Yam, David Di Lorenzo, Dario Izzo
ISI
2005
Springer
14 years 26 days ago
Information Supply Chain: A Unified Framework for Information-Sharing
To balance demand and supply of information, we propose a framework called “information supply chain” (ISC). This framework is based on supply chain management (SCM), which has...
Shuang Sun, John Yen
DM
2006
128views more  DM 2006»
13 years 7 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck