Sciweavers

3791 search results - page 22 / 759
» Packing sets of patterns
Sort
View
ADC
2003
Springer
123views Database» more  ADC 2003»
14 years 19 days ago
A Distance-Based Packing Method for High Dimensional Data
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...
Tae-wan Kim, Ki-Joune Li
RTCSA
2000
IEEE
13 years 11 months ago
Frame packing in real-time communication
A common computational model in distributed embedded systems is that the nodes exchange signals via a network. Most often a signal represents the state of some physical device and...
Kristian Sandström, Christer Norström, M...
ANOR
2005
160views more  ANOR 2005»
13 years 7 months ago
Packing r-Cliques in Weighted Chordal Graphs
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...
ICIAR
2010
Springer
13 years 6 months ago
Geometrical Characterization of Various Shaped 3D-Aggregates of Primary Spherical Particules by Radial Distribution Functions
Abstract. Multi-scale aggregates are composed of particles which results themselves of agglomeration of other primary particles. If particles are modeled by their centers, the geom...
Marthe Lagarrigue, Johan Debayle, Sandra Jacquier,...
ICTAI
2005
IEEE
14 years 1 months ago
Using a Lagrangian Heuristic for a Combinatorial Auction Problem
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Jiqing T...