Sciweavers

1798 search results - page 318 / 360
» Generating presentation constraints from rhetorical structur...
Sort
View
91
Voted
PKDD
2009
Springer
124views Data Mining» more  PKDD 2009»
15 years 7 months ago
Capacity Control for Partially Ordered Feature Sets
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
Ulrich Rückert
111
Voted
ICDM
2008
IEEE
184views Data Mining» more  ICDM 2008»
15 years 7 months ago
Bayesian Co-clustering
In recent years, co-clustering has emerged as a powerful data mining tool that can analyze dyadic data connecting two entities. However, almost all existing co-clustering techniqu...
Hanhuai Shan, Arindam Banerjee
LICS
2008
IEEE
15 years 7 months ago
Winning Regions of Higher-Order Pushdown Games
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H...
CEC
2007
IEEE
15 years 7 months ago
On some symmetry based validity indices
—Identification of the correct number of clusters and the corresponding partitioning are two important considerations in clustering. In this paper, a newly developed point symme...
Sriparna Saha, Sanghamitra Bandyopadhyay
ESA
2007
Springer
188views Algorithms» more  ESA 2007»
15 years 6 months ago
Fast and Compact Oracles for Approximate Distances in Planar Graphs
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
Laurent Flindt Muller, Martin Zachariasen