2191 search results - page 129 / 439 » Improving the Efficiency of Non-Deterministic Computations |
130
Voted
PVLDB
2010
14 years 7 months ago
2010
Top-k spatial preference queries return a ranked set of the k best data objects based on the scores of feature objects in their spatial neighborhood. Despite the wide range of loc...
95
Voted
KDD
2008
ACM
16 years 1 months ago
2008
ACM
In this paper, we propose a set of novel regression-based approaches to effectively and efficiently summarize frequent itemset patterns. Specifically, we show that the problem of ...
FMICS
2008
Springer
15 years 2 months ago
2008
Springer
Different approaches have been developed to mitigate the state space explosion of model checking techniques. Among them, symbolic verification techniques use efficient representati...
104
click to vote
CSC
2008
15 years 2 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
113
Voted
TMI
2008
15 years 20 days ago
2008
Abstract-- We present a new method for automatic segmentation of heterogeneous image data that takes a step toward bridging the gap between bottom-up affinity-based segmentation me...