Sciweavers

137 search results - page 23 / 28
» Parameterized approximation of dominating set problems
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Evaluating top-k queries over incomplete data streams
We study the problem of continuous monitoring of top-k queries over multiple non-synchronized streams. Assuming a sliding window model, this general problem has been a well addres...
Parisa Haghani, Sebastian Michel, Karl Aberer
KSEM
2009
Springer
14 years 2 months ago
A Competitive Learning Approach to Instance Selection for Support Vector Machines
Abstract. Support Vector Machines (SVM) have been applied successfully in a wide variety of fields in the last decade. The SVM problem is formulated as a convex objective function...
Mario Zechner, Michael Granitzer
ISAAC
2007
Springer
135views Algorithms» more  ISAAC 2007»
14 years 1 months ago
Fast Evaluation of Union-Intersection Expressions
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
Philip Bille, Anna Pagh, Rasmus Pagh
IPMI
2007
Springer
14 years 8 months ago
Shape Modeling and Analysis with Entropy-Based Particle Systems
This paper presents a new method for constructing compact statistical point-based models of ensembles of similar shapes that does not rely on any specific surface parameterization....
Joshua E. Cates, P. Thomas Fletcher, Martin Andrea...
ICDM
2007
IEEE
132views Data Mining» more  ICDM 2007»
14 years 1 months ago
Learning What Makes a Society Tick
We present a machine learning methodology (models, algorithms, and experimental data) to discovering the agent dynamics that drive the evolution of the social groups in a communit...
Hung-Ching Chen, Mark K. Goldberg, Malik Magdon-Is...