Sciweavers

3894 search results - page 732 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
TOG
2010
64views more  TOG 2010»
14 years 6 months ago
K-set tilable surfaces
This paper introduces a method for optimizing the tiles of a quadmesh. Given a quad-based surface, the goal is to generate a set of K quads whose instances can produce a tiled sur...
Chi-Wing Fu, Chi-Fu Lai, Ying He 0001, Daniel Cohe...
COCOA
2009
Springer
15 years 4 months ago
On Open Rectangle-of-Influence Drawings of Planar Graphs
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
Huaming Zhang, Milind Vaidya
BROADNETS
2007
IEEE
15 years 6 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, ...
ECCC
2010
124views more  ECCC 2010»
14 years 12 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
14 years 11 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