Sciweavers

500 search results - page 92 / 100
» Approximation algorithms for maximum independent set of pseu...
Sort
View
104
Voted
ICML
2009
IEEE
15 years 8 months ago
Non-monotonic feature selection
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
Zenglin Xu, Rong Jin, Jieping Ye, Michael R. Lyu, ...
CORR
2012
Springer
225views Education» more  CORR 2012»
13 years 9 months ago
The Filter-Placement Problem and its Application to Minimizing Information Multiplicity
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
Dóra Erdös, Vatche Ishakian, Andrei La...
129
Voted
BMCBI
2007
142views more  BMCBI 2007»
15 years 1 months ago
SABERTOOTH: protein structural alignment based on a vectorial structure representation
Background: The task of computing highly accurate structural alignments of proteins in very short computation time is still challenging. This is partly due to the complexity of pr...
Florian Teichert, Ugo Bastolla, Markus Porto
CGF
2011
14 years 5 months ago
Estimating Color and Texture Parameters for Vector Graphics
Diffusion curves are a powerful vector graphic representation that stores an image as a set of 2D Bezier curves with colors defined on either side. These colors are diffused over...
Stefan Jeschke, David Cline, Peter Wonka
VLDB
2008
ACM
147views Database» more  VLDB 2008»
16 years 1 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...