136 search results - page 10 / 28 » A Polynomial-Time Algorithm for Global Value Numbering |
114
click to vote
KDD
2005
ACM
16 years 5 days ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
175
click to vote
FOSSACS
2011
Springer
14 years 3 months ago
2011
Springer
Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The speci...
WWW
2008
ACM
16 years 13 days ago
2008
ACM
Service discovery employs matching techniques to select services by comparing their descriptions against user constraints. Semantic-based matching approaches achieve higher recall...
102
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
114
click to vote
JEI
2007
14 years 11 months ago
2007
Abstract. We develop a method for automatic colorization of images (or two-dimensional fields) in order to visualize pixel values and their local differences. In many applications...