Sciweavers

1923 search results - page 159 / 385
» Weighted Decision Trees
Sort
View
DAC
2005
ACM
16 years 7 months ago
Power-aware placement
Lowering power is one of the greatest challenges facing the IC industry today. We present a power-aware placement method that simultaneously performs (1) activity-based register c...
Yongseok Cheon, Pei-Hsin Ho, Andrew B. Kahng, Sher...
ESA
2009
Springer
109views Algorithms» more  ESA 2009»
16 years 29 days ago
Iterative Rounding for Multi-Objective Optimization Problems
In this paper we show that iterative rounding is a powerful and flexible tool in the design of approximation algorithms for multiobjective optimization problems. We illustrate tha...
Fabrizio Grandoni, R. Ravi, Mohit Singh
ESA
2004
Springer
95views Algorithms» more  ESA 2004»
15 years 11 months ago
On Dynamic Shortest Paths Problems
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
Liam Roditty, Uri Zwick
PODS
2007
ACM
196views Database» more  PODS 2007»
16 years 6 months ago
On the complexity of managing probabilistic XML data
In [3], we introduced a framework for querying and updating probabilistic information over unordered labeled trees, the probabilistic tree model. The data model is based on trees ...
Pierre Senellart, Serge Abiteboul
ACL
2006
15 years 7 months ago
Guiding a Constraint Dependency Parser with Supertags
We investigate the utility of supertag information for guiding an existing dependency parser of German. Using weighted constraints to integrate the additionally available informat...
Kilian A. Foth, Tomas By, Wolfgang Menzel