Sciweavers

1933 search results - page 282 / 387
» Improved Algorithms for the Feedback Vertex Set Problems
Sort
View
140
Voted
PVLDB
2010
112views more  PVLDB 2010»
15 years 2 months ago
On Triangulation-based Dense Neighborhood Graphs Discovery
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
Nan Wang, Jingbo Zhang, Kian-Lee Tan, Anthony K. H...
148
Voted
ICPR
2004
IEEE
16 years 4 months ago
Large Scale Feature Selection Using Modified Random Mutation Hill Climbing
Feature selection is a critical component of many pattern recognition applications. There are two distinct mechanisms for feature selection, namely the wrapper method and the filt...
Anil K. Jain, Michael E. Farmer, Shweta Bapna
135
Voted
ICML
2009
IEEE
16 years 4 months ago
Learning with structured sparsity
This paper investigates a new learning formulation called structured sparsity, which is a naturalextensionofthestandardsparsityconceptinstatisticallearningandcompressivesensing. B...
Junzhou Huang, Tong Zhang, Dimitris N. Metaxas
105
Voted
WADS
2007
Springer
68views Algorithms» more  WADS 2007»
15 years 9 months ago
On Euclidean Vehicle Routing with Allocation
The (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean TSP. We do not require that all points lie on the salesman tour. However, points that do ...
Jan Remy, Reto Spöhel, Andreas Weißl
147
Voted
JIIS
2006
103views more  JIIS 2006»
15 years 3 months ago
Time-focused clustering of trajectories of moving objects
Spatio-temporal, geo-referenced datasets are growing rapidly, and will be more in the near future, due to both technological and social/commercial reasons. From the data mining vie...
Mirco Nanni, Dino Pedreschi