Sciweavers

340 search results - page 58 / 68
» A New Algorithm for the Construction of Optimal B-Trees
Sort
View
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 9 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
MMB
2012
Springer
259views Communications» more  MMB 2012»
12 years 4 months ago
Boosting Design Space Explorations with Existing or Automatically Learned Knowledge
Abstract. During development, processor architectures can be tuned and configured by many different parameters. For benchmarking, automatic design space explorations (DSEs) with h...
Ralf Jahr, Horia Calborean, Lucian Vintan, Theo Un...
IWQOS
2005
Springer
14 years 2 months ago
A High-Throughput Overlay Multicast Infrastructure with Network Coding
Network coding has been recently proposed in information theory as a new dimension of the information multicast problem that helps achieve optimal transmission rate or cost. End ho...
Mea Wang, Zongpeng Li, Baochun Li
SIGGRAPH
1997
ACM
14 years 29 days ago
Progressive simplicial complexes
In this paper, we introduce the progressive simplicial complex (PSC) representation, a new format for storing and transmitting triangulated geometric models. Like the earlier prog...
Jovan Popovic, Hugues Hoppe
COR
2010
177views more  COR 2010»
13 years 9 months ago
Hybridization of very large neighborhood search for ready-mixed concrete delivery problems
Companies in the concrete industry are facing the following scheduling problem on a daily basis: concrete produced at several plants has to be delivered at customers' constru...
Verena Schmid, Karl F. Doerner, Richard F. Hartl, ...