9849 search results - page 188 / 1970 » Algorithms and Experiments for the Webgraph |
142
Voted
JMLR
2010
14 years 11 months ago
2010
Massive Online Analysis (MOA) is a software environment for implementing algorithms and running experiments for online learning from evolving data streams. MOA includes a collecti...
172
Voted
DLOG
2011
14 years 8 months ago
2011
We show that deciding conjunctive query inseparability for OWL 2 QL ontologies is PSpace-hard and in ExpTime. We give polynomial-time (incomplete) algorithms and demonstrate by exp...
138
click to vote
COMGEO
2004
ACM
15 years 4 months ago
2004
ACM
We present a new incremental algorithm for constructing the union of n triangles in the plane. In our experiments, the new algorithm, which we call the Disjoint-Cover (DC) algorit...
130
Voted
COMPGEOM
1995
ACM
15 years 8 months ago
1995
ACM
This paper presents an experimental comparison of a number of different algorithms for computing the Deluanay triangulation. The algorithms examined are: Dwyer’s divide and conq...
145
click to vote
NIPS
2000
15 years 6 months ago
2000
A new incremental learning algorithm is described which approximates the maximal margin hyperplane w.r.t. norm p 2 for a set of linearly separable data. Our algorithm, called alm...