Sciweavers

2796 search results - page 398 / 560
» The coolest path problem
Sort
View
PAKDD
2004
ACM
186views Data Mining» more  PAKDD 2004»
15 years 11 months ago
CMTreeMiner: Mining Both Closed and Maximal Frequent Subtrees
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
Yun Chi, Yirong Yang, Yi Xia, Richard R. Muntz
SCN
2004
Springer
112views Communications» more  SCN 2004»
15 years 11 months ago
Controlling Spam by Secure Internet Content Selection
Unsolicited and undesirable e-mail (spam) is a growing problem for Internet users and service providers. We present the Secure Internet Content Selection (SICS) protocol, an effic...
Amir Herzberg
DATE
2003
IEEE
103views Hardware» more  DATE 2003»
15 years 11 months ago
Reduced Delay Uncertainty in High Performance Clock Distribution Networks
The design of clock distribution networks in synchronous digital systems presents enormous challenges. Controlling the clock signal delay in the presence of various noise sources,...
Dimitrios Velenis, Marios C. Papaefthymiou, Eby G....
HICSS
2003
IEEE
141views Biometrics» more  HICSS 2003»
15 years 11 months ago
Understanding the Foundation of Mobile Content Quality A Presentation of a New Research Field
This paper studies some problems regarding mobile content quality (MCQ). Since the reason for communication is to be useful, we think that the only way of creating precise target ...
Pär Landor
ICCAD
2003
IEEE
129views Hardware» more  ICCAD 2003»
15 years 11 months ago
Performance Optimization of Latency Insensitive Systems Through Buffer Queue Sizing of Communication Channels
This paper proposes for latency insensitive systems a performance optimization technique called channel buffer queue sizing, which is performed after relay station insertion in th...
Ruibing Lu, Cheng-Kok Koh