Sciweavers

9405 search results - page 367 / 1881
» Computing a Model of Set Theory
Sort
View
CSR
2007
Springer
16 years 13 days ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka
COLING
2010
15 years 1 months ago
A Vector Space Model for Subjectivity Classification in Urdu aided by Co-Training
The goal of this work is to produce a classifier that can distinguish subjective sentences from objective sentences for the Urdu language. The amount of labeled data required for ...
Smruthi Mukund, Rohini K. Srihari
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
16 years 6 months ago
Tell me something I don't know: randomization strategies for iterative data mining
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
Heikki Mannila, Kai Puolamäki, Markus Ojala, ...
CORR
2008
Springer
138views Education» more  CORR 2008»
15 years 6 months ago
Computing Minimum Spanning Trees with Uncertainty
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
Thomas Erlebach, Michael Hoffmann 0002, Danny Kriz...
124
Voted
IJAIT
2007
69views more  IJAIT 2007»
15 years 6 months ago
A Psychogenetic Algorithm for Behavioral Sequence Learning
: This work presents an original algorithmic model of some essential features of psychogenetic theory, as was proposed by J.Piaget. Specifically, we modeled some elements of cognit...
Vittorio Maniezzo, Matteo Roffilli