Sciweavers

654 search results - page 48 / 131
» Ordered Sets and Complete Lattices
Sort
View
LICS
2007
IEEE
14 years 1 months ago
On Noetherian Spaces
A topological space is Noetherian iff every open is compact. Our starting point is that this notion generalizes that of well-quasi order, in the sense that an Alexandroff-discrete...
Jean Goubault-Larrecq
IJAC
2002
128views more  IJAC 2002»
13 years 7 months ago
Computational Complexity of Generators and Nongenerators in Algebra
Abstract. We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determin...
Clifford Bergman, Giora Slutzki
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
13 years 11 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
EMNLP
2008
13 years 9 months ago
Lattice-based Minimum Error Rate Training for Statistical Machine Translation
Minimum Error Rate Training (MERT) is an effective means to estimate the feature function weights of a linear model such that an automated evaluation criterion for measuring syste...
Wolfgang Macherey, Franz Josef Och, Ignacio Thayer...
ICASSP
2011
IEEE
12 years 11 months ago
Downsampling graphs using spectral theory
In this paper we present methods for downsampling datasets defined on graphs (i.e., graph-signals) by extending downsampling results for traditional N-dimensional signals. In par...
Sunil K. Narang, Antonio Ortega