2168 search results - page 88 / 434 » Randomized Algorithms and Complexity Theory |
102
click to vote
KDD
1998
ACM
15 years 7 months ago
1998
ACM
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
162
click to vote
STACS
1993
Springer
15 years 7 months ago
1993
Springer
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
127
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
NAACL
2007
15 years 4 months ago
2007
We relate the problem of finding the best application of a Synchronous ContextFree Grammar (SCFG) rule during parsing to a Markov Random Field. This representation allows us to u...
124
click to vote
ACMSE
2006
ACM
15 years 9 months ago
2006
ACM
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...