Sciweavers

1491 search results - page 254 / 299
» Training Linear Discriminant Analysis in Linear Time
Sort
View
SODA
2008
ACM
200views Algorithms» more  SODA 2008»
13 years 10 months ago
Clustering for metric and non-metric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P, our goal is to find a set C of size k such that the s...
Marcel R. Ackermann, Johannes Blömer, Christi...
ALGORITHMICA
2007
145views more  ALGORITHMICA 2007»
13 years 9 months ago
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
COR
2010
164views more  COR 2010»
13 years 9 months ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz
VTC
2010
IEEE
114views Communications» more  VTC 2010»
13 years 7 months ago
On Non-Stationary Urban Macrocell Channels in a Cooperative Downlink Beamforming Scenario
—A common simplification in the treatment of random linear channels is the assumption of stationarity of the channel in time. The wireless channel is, however, known to be inher...
Adrian Ispas, Gerd Ascheid, Christian Schneider, R...
CODES
2010
IEEE
13 years 6 months ago
Improving platform-based system synthesis by satisfiability modulo theories solving
Due to the ever increasing system complexity, deciding whether a given platform is sufficient to implement a set of applications under given constraints becomes a serious bottlene...
Felix Reimann, Michael Glaß, Christian Haube...