Sciweavers

3105 search results - page 356 / 621
» The Path-Packing Structure of Graphs
Sort
View
PODS
2004
ACM
139views Database» more  PODS 2004»
16 years 4 months ago
On Preservation under Homomorphisms and Unions of Conjunctive Queries
Unions of conjunctive queries, also known as select-project-join-union queries, are the most frequently asked queries in relational database systems. These queries are definable b...
Albert Atserias, Anuj Dawar, Phokion G. Kolaitis
143
Voted
UAI
2003
15 years 6 months ago
Learning Continuous Time Bayesian Networks
Continuous time Bayesian networks (CTBN) describe structured stochastic processes with finitely many states that evolve over continuous time. A CTBN is a directed (possibly cycli...
Uri Nodelman, Christian R. Shelton, Daphne Koller
JCISE
2002
117views more  JCISE 2002»
15 years 4 months ago
Memory Analysis of Solid Model Representations for Heterogeneous Objects
Methods to represent and exchange parts consisting of Functionally Graded Material (FGM) for Solid Freeform Fabrication (SFF) with Local Composition Control (LCC) are evaluated ba...
Todd R. Jackson, Wonjoon Cho, Nicholas M. Patrikal...
218
Voted
SIGMOD
2009
ACM
182views Database» more  SIGMOD 2009»
16 years 4 months ago
3-HOP: a high-compression indexing scheme for reachability query
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry
148
Voted
HICSS
1995
IEEE
128views Biometrics» more  HICSS 1995»
15 years 8 months ago
Instruction Level Parallelism
Abstract. We reexamine the limits of parallelism available in programs, using runtime reconstruction of program data-flow graphs. While limits of parallelism have been examined in...