Sciweavers

1756 search results - page 242 / 352
» Directed scale-free graphs
Sort
View
101
Voted
ESANN
2004
15 years 2 months ago
Neural methods for non-standard data
Standard pattern recognition provides effective and noise-tolerant tools for machine learning tasks; however, most approaches only deal with real vectors of a finite and fixed dime...
Barbara Hammer, Brijnesh J. Jain
112
Voted
DMDW
2001
194views Management» more  DMDW 2001»
15 years 2 months ago
Logical Multidimensional Database Design for Ragged and Unbalanced Aggregation
Research on logical design of OLAP cubes has tended to assume that the rollup hierarchy in a cube dimension takes the form of a balanced tree. However, experience from industry in...
Tapio Niemi, Jyrki Nummenmaa, Peter Thanisch
101
Voted
GVD
2001
142views Database» more  GVD 2001»
15 years 2 months ago
An approach to the model-based fragmentation and relational storage of XML-documents
A flexible method to store XML documents in relational or object-relational databases is presented that is based on an adaptable fragmentation. Whereas most known approaches decom...
Christian Süß
97
Voted
IPCO
2004
114views Optimization» more  IPCO 2004»
15 years 2 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...
104
Voted
IJCAI
2001
15 years 2 months ago
A Perspective on Knowledge Compilation
We propose a perspective on knowledge compilation which calls for analyzing different compilation approaches according to two key dimensions: the succinctness of the target compil...
Adnan Darwiche, Pierre Marquis