Sciweavers

415 search results - page 64 / 83
» An efficient approximation for the Generalized Assignment Pr...
Sort
View
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
14 years 7 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 7 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
14 years 7 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
VISUALIZATION
1998
IEEE
13 years 11 months ago
Smooth view-dependent level-of-detail control and its application to terrain rendering
The key to real-time rendering of large-scale surfaces is to locally adapt surface geometric complexity to changing view parameters. Several schemes have been developed to address...
Hugues Hoppe
ICIP
2004
IEEE
14 years 9 months ago
Feature statistical retrieval applied to content-based copy identification
In many image or video retrieval systems, the search of similar objects in the database includes a spatial access method to a multidimensional feature space. This step is generall...
Alexis Joly, Carl Frélicot, Olivier Buisson