10608 search results - page 1703 / 2122 » Complexity of O'Hara's Algorithm |
234
click to vote
PODS
2009
ACM
16 years 5 months ago
2009
ACM
We consider the problem of deciding query equivalence for a conjunctive language in which queries output complex objects composed from a mixture of nested, unordered collection ty...
113
click to vote
MOBIHOC
2009
ACM
16 years 5 months ago
2009
ACM
Due to its low complexity, Greedy Maximal Scheduling (GMS), also known as Longest Queue First (LQF), has been studied extensively for wireless networks. However, GMS can result in...
150
Voted
KDD
2006
ACM
16 years 5 months ago
2006
ACM
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
149
click to vote
KDD
2002
ACM
16 years 5 months ago
2002
ACM
Support vector machines (SVMs) excel at two-class discriminative learning problems. They often outperform generative classifiers, especially those that use inaccurate generative m...
161
click to vote
KDD
2002
ACM
16 years 5 months ago
2002
ACM
Instance selection and feature selection are two orthogonal methods for reducing the amount and complexity of data. Feature selection aims at the reduction of redundant features i...