Sciweavers

1576 search results - page 226 / 316
» Streaming Algorithms for Independent Sets
Sort
View
225
Voted
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 11 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...
ICML
2006
IEEE
16 years 6 months ago
The support vector decomposition machine
In machine learning problems with tens of thousands of features and only dozens or hundreds of independent training examples, dimensionality reduction is essential for good learni...
Francisco Pereira, Geoffrey J. Gordon
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
16 years 6 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
SOFSEM
2010
Springer
16 years 2 months ago
Fast Arc-Annotated Subsequence Matching in Linear Space
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
Philip Bille, Inge Li Gørtz
COMPGEOM
2004
ACM
15 years 11 months ago
A computational framework for incremental motion
We propose a generic computational framework for maintaining a discrete geometric structure defined by a collection of static and mobile objects. We assume that the mobile object...
David M. Mount, Nathan S. Netanyahu, Christine D. ...