118 search results - page 19 / 24 » Greedy algorithms for on-line set-covering and related probl... |
KR
2000
Springer
15 years 3 months ago
2000
Springer
We investigate the problem of reasoning with partitions of related logical axioms. Our motivation is two-fold. First, we are concerned with how to reason effectively with multiple...
91
Voted
CIKM
2009
Springer
15 years 4 months ago
2009
Springer
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
CSB
2005
IEEE
15 years 5 months ago
2005
IEEE
With hierarchical clustering methods, divisions or fusions, once made, are irrevocable. As a result, when two elements in a bottom-up algorithm are assigned to one cluster, they c...
101
click to vote
EDBT
2006
ACM
15 years 12 months ago
2006
ACM
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...
ICML
2007
IEEE
16 years 17 days ago
2007
IEEE
Markov logic networks (MLNs) are a statistical relational model that consists of weighted firstorder clauses and generalizes first-order logic and Markov networks. The current sta...