8838 search results - page 1323 / 1768 » Generalizing Domain Theory |
208
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
182
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
As a fundamental data mining task, frequent pattern mining has widespread applications in many different domains. Research in frequent pattern mining has so far mostly focused on ...
181
click to vote
WSDM
2010
ACM
16 years 4 months ago
2010
ACM
As the Web provides rich data embedded in the immense contents inside pages, we witness many ad-hoc efforts for exploiting fine granularity information across Web text, such as We...
212
click to vote
CCS
2007
ACM
16 years 1 months ago
2007
ACM
Traditional Public Key Infrastructures (PKI) have not lived up to their promise because there are too many ways to define PKIs, too many cryptographic primitives to build them wi...
181
click to vote
IJCNN
2006
IEEE
16 years 28 days ago
2006
IEEE
— In connectionist learning, one relevant problem is “catastrophic forgetting” that may occur when a network, trained with a large set of patterns, has to learn new input pat...