Sciweavers

900 search results - page 27 / 180
» On Polynomial Time Computation over Unordered Structures
Sort
View
CEC
2008
IEEE
14 years 3 months ago
Reduced polynomial neural swarm net for classification task in data mining
—In this paper, we proposed a reduced polynomial neural swarm net (RPNSN) for the task of classification. Classification task is one of the most studied tasks of data mining. In ...
Bijan Bihari Misra, Satchidananda Dehuri, Pradipta...
ACL
2009
13 years 6 months ago
Unsupervised Multilingual Grammar Induction
We investigate the task of unsupervised constituency parsing from bilingual parallel corpora. Our goal is to use bilingual cues to learn improved parsing models for each language ...
Benjamin Snyder, Tahira Naseem, Regina Barzilay
CVPR
2012
IEEE
11 years 11 months ago
Image categorization using Fisher kernels of non-iid image models
The bag-of-words (BoW) model treats images as an unordered set of local regions and represents them by visual word histograms. Implicitly, regions are assumed to be identically an...
Ramazan Gokberk Cinbis, Jakob J. Verbeek, Cordelia...
CPC
2006
93views more  CPC 2006»
13 years 9 months ago
Generating Outerplanar Graphs Uniformly at Random
We show how to generate labeled and unlabeled outerplanar graphs with n vertices uniformly at random in polynomial time in n. To generate labeled outerplanar graphs, we present a c...
Manuel Bodirsky, Mihyun Kang
ICDE
2011
IEEE
234views Database» more  ICDE 2011»
13 years 13 days ago
Massively parallel XML twig filtering using dynamic programming on FPGAs
Abstract— In recent years, XML-based Publish-Subscribe Systems have become popular due to the increased demand of timely event-notification. Users (or subscribers) pose complex ...
Roger Moussalli, Mariam Salloum, Walid A. Najjar, ...