42230 search results - page 394 / 8446 » Algorithms and Complexity Results for |
180
click to vote
ICFCA
2010
Springer
16 years 1 months ago
2010
Springer
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...
202
click to vote
CIKM
1997
Springer
15 years 11 months ago
1997
Springer
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
156
click to vote
FCT
2005
Springer
16 years 11 days ago
2005
Springer
We prove completeness results for twenty-three problems in semilinear geometry. These results involve semilinear sets given by additive circuits as input data. If arbitrary real co...
232
click to vote
WWW
2001
ACM
16 years 7 months ago
2001
ACM
The Visual SQL-X system is presented to generate arbitrarily complex XML documents from a graphical query on a relational database. The query describes the structure of the result...
154
Voted
STOC
2003
ACM
16 years 7 months ago
2003
ACM
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...