8724 search results - page 64 / 1745 » Search result diversification |
154
click to vote
IFIP12
2007
15 years 6 months ago
2007
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
155
click to vote
SIGECOM
2004
ACM
15 years 10 months ago
2004
ACM
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
127
click to vote
FOCS
2002
IEEE
15 years 10 months ago
2002
IEEE
We reopen the issue of finding an implicit data structure for the dictionary problem. In particular, we examine the problem of maintaining Ò data values in the first Ò locatio...
176
click to vote
FCCM
2004
IEEE
15 years 9 months ago
2004
IEEE
Network Intrusion Detection and Prevention Systems (IDPS) use string matching to scan Internet packets for malicious content. Bloom filters offer a mechanism to search for a large...
148
click to vote
AIPS
2000
15 years 6 months ago
2000
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...