15073 search results - page 394 / 3015 » Probabilistic algorithms for computing resultants |
162
click to vote
ICPADS
2005
IEEE
16 years 9 days ago
2005
IEEE
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
156
click to vote
COCOON
2005
Springer
16 years 7 days ago
2005
Springer
Given a set of leaf-labelled trees with identical leaf sets, the well-known MAST problem consists of finding a subtree homeomorphically included in all input trees and with the la...
169
click to vote
VLDB
2004
ACM
16 years 2 days ago
2004
ACM
1 Frequent itemset counting is the first step for most association rule algorithms and some classification algorithms. It is the process of counting the number of occurrences of ...
194
Voted
TASE
2008
IEEE
15 years 6 months ago
2008
IEEE
An automated system for planning and optimization of lumber production using Machine Vision and Computed Tomography (CT) is proposed. Cross-sectional CT images of hardwood logs are...
182
click to vote
EMMCVPR
2011
Springer
14 years 6 months ago
2011
Springer
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...