Sciweavers

2520 search results - page 359 / 504
» The complexity of approximating entropy
Sort
View
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
16 years 5 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
SIGMOD
2001
ACM
136views Database» more  SIGMOD 2001»
16 years 4 months ago
Selectivity Estimation using Probabilistic Models
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query...
Lise Getoor, Benjamin Taskar, Daphne Koller
ICRA
2008
IEEE
150views Robotics» more  ICRA 2008»
15 years 11 months ago
A Bayesian approach to empirical local linearization for robotics
— Local linearizations are ubiquitous in the control of robotic systems. Analytical methods, if available, can be used to obtain the linearization, but in complex robotics system...
Jo-Anne Ting, Aaron D'Souza, Sethu Vijayakumar, St...
COMPGEOM
2006
ACM
15 years 10 months ago
Envelope surfaces
We construct a class of envelope surfaces in Rd , more precisely envelopes of balls. An envelope surface is a closed C1 (tangent continuous) manifold wrapping tightly around the u...
Nico Kruithof, Gert Vegter
CIG
2005
IEEE
15 years 10 months ago
Forcing Neurocontrollers to Exploit Sensory Symmetry Through Hard-wired Modularity in the Game of Cellz
Several attempts have been made in the past to construct encoding schemes that allow modularity to emerge in evolving systems, but success is limited. We believe that in order to c...
Julian Togelius, Simon M. Lucas