Sciweavers

523 search results - page 21 / 105
» Graph-Based Induction for General Graph Structured Data
Sort
View
VLDB
2002
ACM
106views Database» more  VLDB 2002»
13 years 7 months ago
Structure and Value Synopses for XML Data Graphs
All existing proposals for querying XML (e.g., XQuery) rely on a pattern-specification language that allows (1) path navigation and branching through the label structure of the XM...
Neoklis Polyzotis, Minos N. Garofalakis
GD
2009
Springer
13 years 5 months ago
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...
Ioannis Z. Emiris, Elias P. Tsigaridas, Antonios V...
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
14 years 6 days ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld
EWCBR
1994
Springer
13 years 11 months ago
Integrating Induction and Case-Based Reasoning: Methodological Approach and First Evaluations
We propose in this paper a general framework for integrating inductive and case-based reasoning (CBR) techniques for diagnosis tasks. We present a set of practical integrated appro...
Eric Auriol, Michel Manago, Klaus-Dieter Althoff, ...
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 7 months ago
Component Evolution in General Random Intersection Graphs
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
Milan Bradonjic, Aric A. Hagberg, Nicolas W. Henga...