Sciweavers

371 search results - page 19 / 75
» Computation of the Minimal Associated Primes
Sort
View
MP
1998
117views more  MP 1998»
13 years 7 months ago
The node capacitated graph partitioning problem: A computational study
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
Carlos Eduardo Ferreira, Alexander Martin, C. Carv...
ICS
1993
Tsinghua U.
13 years 11 months ago
Graph Contraction for Physical Optimization Methods: A Quality-Cost Tradeoff for Mapping Data on Parallel Computers
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
Nashat Mansour, Ravi Ponnusamy, Alok N. Choudhary,...
PEWASUN
2007
ACM
13 years 9 months ago
Worst-case lifetime computation of a wireless sensor network by model-checking
Wireless Sensor Network (WSN) technology is now mature enough to be used in numerous application domains. However, due to the restricted amount of energy usually allocated to each...
Laurent Mounier, Ludovic Samper, Wassim Znaidi
ICPR
2008
IEEE
14 years 8 months ago
Bregman distance to L1 regularized logistic regression
In this work we investigate the relationship between Bregman distances and regularized Logistic Regression model. We present a detailed study of Bregman Distance minimization, a f...
Mithun Das Gupta, Thomas S. Huang
CLA
2007
13 years 9 months ago
ZART: A Multifunctional Itemset Mining Algorithm
Abstract. In this paper, we present and detail a multifunctional itemset mining algorithm called Zart, which is based on the Pascal algorithm. Zart shows a number of additional fea...
Laszlo Szathmary, Amedeo Napoli, Sergei O. Kuznets...