Sciweavers

2370 search results - page 137 / 474
» A Structured Set of Higher-Order Problems
Sort
View
CIAC
2010
Springer
232views Algorithms» more  CIAC 2010»
15 years 6 months ago
Multicut Algorithms via Tree Decompositions
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
Reinhard Pichler, Stefan Rümmele, Stefan Woltran
79
Voted
ICASSP
2008
IEEE
15 years 10 months ago
Constrained nonlinear minimum mse estimation
We address the problem of minimum mean-squared error (MMSE) estimation where the estimator is constrained to belong to a prede ned set of functions. We derive a simple closed form...
Tomer Michaeli, Yonina C. Eldar
ISAAC
2009
Springer
101views Algorithms» more  ISAAC 2009»
15 years 10 months ago
Maintaining Nets and Net Trees under Incremental Motion
The problem of maintaining geometric structures for points in motion has been well studied over the years. Much theoretical work to date has been based on the assumption that point...
Minkyoung Cho, David M. Mount, Eunhui Park
122
Voted
ICCAD
1995
IEEE
113views Hardware» more  ICCAD 1995»
15 years 7 months ago
Logic decomposition during technology mapping
—A problem in technology mapping is that the quality of the final implementation depends significantly on the initially provided circuit structure. This problem is critical, es...
Eric Lehman, Yosinori Watanabe, Joel Grodstein, He...
131
Voted
CORR
2012
Springer
250views Education» more  CORR 2012»
13 years 11 months ago
Mining Attribute-structure Correlated Patterns in Large Attributed Graphs
In this work, we study the correlation between attribute sets and the occurrence of dense subgraphs in large attributed graphs, a task we call structural correlation pattern minin...
Arlei Silva, Wagner Meira Jr., Mohammed J. Zaki