Sciweavers

3006 search results - page 500 / 602
» Dimensionality reduction and generalization
Sort
View
ANOR
2010
135views more  ANOR 2010»
15 years 6 months ago
A framework of irregularity enlightenment for data pre-processing in data mining
Abstract Irregularities are widespread in large databases and often lead to erroneous conclusions with respect to data mining and statistical analysis. For example, considerable bi...
Siu-Tong Au, Rong Duan, Siamak G. Hesar, Wei Jiang
APAL
2007
131views more  APAL 2007»
15 years 6 months ago
Bounded fixed-parameter tractability and reducibility
We study a refined framwork of parameterized complexity theory where the parameter dependendence of fixed-parameter tractable algorithms is not arbitrary, but restricted by a fu...
Rod Downey, Jörg Flum, Martin Grohe, Mark Wey...
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 6 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
CGF
2010
112views more  CGF 2010»
15 years 6 months ago
Winding Roads: Routing edges into bundles
Visualizing graphs containing many nodes and edges efficiently is quite challenging. Drawings of such graphs generally suffer from visual clutter induced by the large amount of ed...
A. Lambert, Romain Bourqui, David Auber
CORR
2008
Springer
175views Education» more  CORR 2008»
15 years 6 months ago
Energy Aware Self-Organizing Density Management in Wireless Sensor Networks
Energy consumption is the most important factor that determines sensor node lifetime. The optimization of wireless sensor network lifetime targets not only the reduction of energy...
Erwan Le Merrer, Vincent Gramoli, Anne-Marie Kerma...