Sciweavers

5595 search results - page 1056 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
16 years 5 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel
128
Voted
BROADNETS
2007
IEEE
15 years 11 months ago
Joint monitoring and routing in wireless sensor networks using robust identifying codes
Wireless Sensor Networks (WSNs) provide an important means of monitoring the physical world, but their ons present challenges to fundamental network services such as routing. In t...
Moshe Laifenfeld, Ari Trachtenberg, Reuven Cohen, ...
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 9 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
ECCC
2010
124views more  ECCC 2010»
15 years 4 months ago
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
IDA
2002
Springer
15 years 4 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
« Prev « First page 1056 / 1119 Last » Next »