621 search results - page 32 / 125 » Global partial orders from sequential data |
NIPS
2004
14 years 11 months ago
2004
Simple lexicographic decision heuristics that consider cues one at a time in a particular order and stop searching for cues as soon as a decision can be made have been shown to be...
191
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
Large databases with uncertain information are becoming more common in many applications including data integration, location tracking, and Web search. In these applications, ranki...
103
click to vote
FORTE
2004
14 years 11 months ago
2004
Abstract. Monitoring large distributed concurrent systems is a challenging task. In this paper we formulate (model-based) diagnosis by means of hidden state history reconstruction,...
116
click to vote
ICNP
2002
IEEE
15 years 2 months ago
2002
IEEE
— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
KDD
2002
ACM
15 years 10 months ago
2002
ACM
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...