Sciweavers

3602 search results - page 37 / 721
» Isn't It About Time
Sort
View
NLDB
2007
Springer
14 years 1 months ago
Developing Methods and Heuristics with Low Time Complexities for Filtering Spam Messages
In this paper, we propose methods and heuristics having high accuracies and low time complexities for filtering spam e-mails. The methods are based on the n-gram approach and a heu...
Tunga Güngör, Ali Çiltik
ISPDC
2006
IEEE
14 years 1 months ago
Managing Information and Time Flow in an Agent-Based E-Commerce System
Recently, we have proposed a comprehensive agent-based e-commerce system. While UML formalized, it lacked details how basic functions – e.g. user request to purchase a given pro...
Maciej Gawinecki, Maria Ganzha, Pawel Kobzdej, Mar...
CPM
2009
Springer
131views Combinatorics» more  CPM 2009»
13 years 11 months ago
Linear Time Suffix Array Construction Using D-Critical Substrings
In this paper we present in detail a new efficient linear time and space suffix array construction algorithm(SACA), called the D-CriticalSubstring algorithm. The algorithm is built...
Ge Nong, Sen Zhang, Wai Hong Chan
UAI
2008
13 years 9 months ago
Sensitivity analysis for finite Markov chains in discrete time
When the initial and transition probabilities of a finite Markov chain in discrete time are not well known, we should perform a sensitivity analysis. This is done by considering a...
Gert De Cooman, Filip Hermans, Erik Quaeghebeur
AAAI
1994
13 years 9 months ago
Automated Modeling for Answering Prediction Questions: Selecting the Time Scale and System Boundary
The ability to answer prediction questions is crucial to reasoning about physical systems. A prediction question poses a hypothetical scenario and asks for the resulting behavior ...
Jeff Rickel, Bruce W. Porter