Sciweavers

446 search results - page 60 / 90
» Learning discrete categorial grammars from structures
Sort
View
JACM
1998
88views more  JACM 1998»
13 years 7 months ago
A Threshold of ln n for Approximating Set Cover
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
Uriel Feige
GECCO
2005
Springer
141views Optimization» more  GECCO 2005»
14 years 1 months ago
Constructing good learners using evolved pattern generators
Self-organization of brain areas in animals begins prenatally, evidently driven by spontaneously generated internal patterns. The neural structures continue to develop postnatally...
Vinod K. Valsalam, James A. Bednar, Risto Miikkula...
CIKM
2009
Springer
14 years 2 months ago
Networks, communities and kronecker products
Emergence of the web and online computing applications gave rise to rich large scale social activity data. One of the principal challenges then is to build models and understandin...
Jure Leskovec
SCA
2007
13 years 10 months ago
Liquid simulation on lattice-based tetrahedral meshes
We describe a method for animating incompressible liquids with detailed free surfaces. For each time step, semiLagrangian contouring computes a new fluid boundary (represented as ...
Nuttapong Chentanez, Bryan E. Feldman, Franç...
COMPGEOM
2007
ACM
13 years 11 months ago
On approximate halfspace range counting and relative epsilon-approximations
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
Boris Aronov, Sariel Har-Peled, Micha Sharir