2796 search results - page 73 / 560 » The coolest path problem |
235
click to vote
ISMIS
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. Frequent itemset mining can be regarded as advanced database querying where a user specifies the dataset to be mined and constraints to be satisfied by the discovered i...
121
click to vote
PLDI
2004
ACM
15 years 7 months ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
131
click to vote
MFCS
2005
Springer
15 years 7 months ago
2005
Springer
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
136
click to vote
ICCAD
1999
IEEE
15 years 6 months ago
1999
IEEE
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
NOMS
2008
IEEE
15 years 8 months ago
2008
IEEE
—Interdomain routes change over time, and it is impressive to observe up to which extent. Routes may change many times in the same day and sometimes in the same hour or minute. S...