Sciweavers

42230 search results - page 394 / 8446
» Algorithms and Complexity Results for
Sort
View
ICFCA
2010
Springer
16 years 2 months ago
Hardness of Enumerating Pseudo-intents in the Lectic Order
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...
Felix Distel
CIKM
1997
Springer
15 years 11 months ago
Learning Belief Networks from Data: An Information Theory Based Approach
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...
Jie Cheng, David A. Bell, Weiru Liu
FCT
2005
Springer
16 years 1 months ago
The Complexity of Semilinear Problems in Succinct Representation
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...
Peter Bürgisser, Felipe Cucker, Paulin Jacob&...
WWW
2001
ACM
16 years 8 months ago
Visual SQL-X: A Graphical Tool for Producing XML Documents from Relational Databases
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...
Renzo Orsini, Massimo Pagotto
STOC
2003
ACM
96views Algorithms» more  STOC 2003»
16 years 8 months ago
Optimal oblivious routing in polynomial time
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...
Yossi Azar, Edith Cohen, Amos Fiat, Haim Kaplan, H...