Sciweavers

468 search results - page 25 / 94
» Optimization of in-network data reduction
Sort
View
SIGGRAPH
1993
ACM
14 years 2 months ago
Mesh optimization
We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh M0, produce a mesh M, of the same to...
Hugues Hoppe, Tony DeRose, Tom Duchamp, John Alan ...
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
14 years 10 months ago
The offset tree for learning with partial labels
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
Alina Beygelzimer, John Langford
AI
2011
Springer
13 years 1 months ago
Subspace Mapping of Noisy Text Documents
Abstract. Subspace mapping methods aim at projecting high-dimensional data into a subspace where a specific objective function is optimized. Such dimension reduction allows the re...
Axel J. Soto, Marc Strickert, Gustavo E. Vazquez, ...
JMLR
2010
125views more  JMLR 2010»
13 years 4 months ago
Variational Relevance Vector Machine for Tabular Data
We adopt the Relevance Vector Machine (RVM) framework to handle cases of tablestructured data such as image blocks and image descriptors. This is achieved by coupling the regulari...
Dmitry Kropotov, Dmitry Vetrov, Lior Wolf, Tal Has...
ECOOP
2012
Springer
12 years 13 days ago
Static Detection of Loop-Invariant Data Structures
As a culture, object-orientation encourages programmers to create objects, both short- and long-lived, without concern for cost. Excessive object creation and initialization can ca...
Guoqing (Harry) Xu, Dacong Yan, Atanas Rountev