4332 search results - page 378 / 867 » A Probabilistic Identification Result |
160
click to vote
QEST
2006
IEEE
16 years 22 days ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
171
Voted
DL
1999
Springer
15 years 11 months ago
1999
Springer
Existing web search engines provide users with the ability to query an off-line database of indices in order to decide on an entry point for further manual navigation. Results are...
185
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
Major search engines currently use the history of a user's actions (e.g., queries, clicks) to personalize search results. In this paper, we present a new personalized service...
166
click to vote
ICIAP
2007
ACM
16 years 27 days ago
2007
ACM
Tracking is usually performed at a single level of data resolution. This paper describes a multi-resolution tracking framework developed with efficiency and robustness in mind. E...
168
click to vote
AAAI
1990
15 years 8 months ago
1990
In this paper, we address the issue of evaluating decision trees generated from training examples by a learning algorithm. We give a set of performance measures and show how some ...