Sciweavers

1188 search results - page 176 / 238
» Extended Graph Unification
Sort
View
IPCO
2004
114views Optimization» more  IPCO 2004»
13 years 10 months ago
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
13 years 10 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
SODA
2004
ACM
87views Algorithms» more  SODA 2004»
13 years 10 months ago
Optimal space lower bounds for all frequency moments
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
David P. Woodruff
PGLDB
2003
166views Database» more  PGLDB 2003»
13 years 10 months ago
ROSA: A Data Model and Query Language for e-Learning Objects
Learning Content Management Systems (LCMS) supports e-learning applications with storage and efficient access for e-learning objects (LO)s. ROSA is a LCMS built as a semantic laye...
Fabio Porto, Ana Maria de Carvalho Moura, Adriana ...
FLAIRS
2000
13 years 10 months ago
Independence Semantics for BKBs
Bayesian KnowledgeBases (BKB)are a rule-based probabilistic modelthat extend BayesNetworks(BN), by allowing context-sensitive independenceand cycles in the directed graph. BKBshav...
Solomon Eyal Shimony, Eugene Santos Jr., Tzachi Ro...