Sciweavers

374 search results - page 34 / 75
» An Empirical Analysis of Personal Digital Document Structure...
Sort
View
SAC
2006
ACM
16 years 1 days ago
Exploiting partial decision trees for feature subset selection in e-mail categorization
In this paper we propose PARTfs which adopts a supervised machine learning algorithm, namely partial decision trees, as a method for feature subset selection. In particular, it is...
Helmut Berger, Dieter Merkl, Michael Dittenbach
CORR
2011
Springer
139views Education» more  CORR 2011»
15 years 1 months ago
A Science Model Driven Retrieval Prototype
This paper is about a better understanding on the structure and dynamics of science and the usage of these insights for compensating the typical problems that arises in metadata-d...
Philipp Mayr, Philipp Schaer, Peter Mutschke
153
Voted
CIKM
2004
Springer
15 years 11 months ago
Node ranking in labeled directed graphs
Our work is motivated by the problem of ranking hyperlinked documents for a given query. Given an arbitrary directed graph with edge and node labels, we present a new flow-based ...
Krishna Prasad Chitrapura, Srinivas R. Kashyap
GECCO
2005
Springer
102views Optimization» more  GECCO 2005»
15 years 11 months ago
Latent variable crossover for k-tablet structures and its application to lens design problems
This paper presents the Real-coded Genetic Algorithms for high-dimensional ill-scaled structures, what is called, the ktablet structure. The k-tablet structure is the landscape th...
Jun Sakuma, Shigenobu Kobayashi
COMPGEOM
2010
ACM
15 years 11 months ago
A dynamic data structure for approximate range searching
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
David M. Mount, Eunhui Park