Sciweavers

1736 search results - page 285 / 348
» The rank-width of Directed Graphs
Sort
View
HICSS
2006
IEEE
114views Biometrics» more  HICSS 2006»
15 years 10 months ago
A Formal Approach towards Assessing the Effectiveness of Anti-Spam Procedures
Spam e-mails have become a serious technological and economic problem. So far we have been reasonably able to resist spam e-mails and use the Internet for regular communication by...
Guido Schryen
ICDM
2006
IEEE
137views Data Mining» more  ICDM 2006»
15 years 10 months ago
Mining Complex Time-Series Data by Learning Markovian Models
In this paper, we propose a novel and general approach for time-series data mining. As an alternative to traditional ways of designing specific algorithm to mine certain kind of ...
Yi Wang, Lizhu Zhou, Jianhua Feng, Jianyong Wang, ...
IPPS
2006
IEEE
15 years 10 months ago
Using virtual grids to simplify application scheduling
Users and developers of grid applications have access to increasing numbers of resources. While more resources generally mean higher capabilities for an application, they also rai...
Richard Y. Huang, Henri Casanova, Andrew A. Chien
IPPS
2006
IEEE
15 years 10 months ago
Relationships between communication models in networks using atomic registers
A distributed system is commonly modelled by a graph where nodes represent processors and there is an edge between two processors if and only if they can communicate directly. In ...
Lisa Higham, Colette Johnen
ASPDAC
2006
ACM
230views Hardware» more  ASPDAC 2006»
15 years 10 months ago
Statistical Bellman-Ford algorithm with an application to retiming
— Process variations in digital circuits make sequential circuit timing validation an extremely challenging task. In this paper, a Statistical Bellman-Ford (SBF) algorithm is pro...
Mongkol Ekpanyapong, Thaisiri Watewai, Sung Kyu Li...