Sciweavers

2743 search results - page 138 / 549
» Minimization of an M-convex Function
Sort
View
ICSE
2001
IEEE-ACM
15 years 11 months ago
Dynamic and Selective Combination of Extensions in Component-Based Applications
Support for dynamic and client-specific customization is required in many application areas. We present a (distributed) application as consisting of a minimal functional core – ...
Eddy Truyen, Bart Vanhaute, Wouter Joosen, Pierre ...
ASPDAC
1999
ACM
122views Hardware» more  ASPDAC 1999»
15 years 10 months ago
A Clustering Based Linear Ordering Algorithm for K-Way Spectral Partitioning
The spectral method can lead to a high quality of multi-way partition due to its ability to capture global netlist information. For spectral partition, n netlist modules are mappe...
Shiuann-Shiuh Lin, Wen-Hsin Chen, Wen-Wei Lin, Tin...
ML
2007
ACM
127views Machine Learning» more  ML 2007»
15 years 6 months ago
Density estimation with stagewise optimization of the empirical risk
We consider multivariate density estimation with identically distributed observations. We study a density estimator which is a convex combination of functions in a dictionary and ...
Jussi Klemelä
JELIA
2010
Springer
15 years 4 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...
TRANSCI
2008
94views more  TRANSCI 2008»
15 years 4 months ago
Routing for Relief Efforts
In the aftermath of a large disaster, the routing of vehicles carrying critical supplies can greatly impact the arrival times to those in need. Since it is critical that the deliv...
Ann Melissa Campbell, Dieter Vandenbussche, Willia...