Sciweavers

1469 search results - page 65 / 294
» Approximate polynomial decomposition
Sort
View
SIAMJO
2010
47views more  SIAMJO 2010»
14 years 4 months ago
Integer Programming Subject to Monomial Constraints
Abstract. We investigate integer programs containing monomial constraints of the type Q iI xi i = b. Due to the number-theoretic nature of these constraints, standard methods based...
Christoph Buchheim, Dennis Michaels, Robert Weisma...
VLSID
2006
IEEE
240views VLSI» more  VLSID 2006»
15 years 10 months ago
An Efficient and Accurate Logarithmic Multiplier Based on Operand Decomposition
Logarithmic Number Systems (LNS) offer a viable alternative in terms of area, delay and power to binary number systems for multiplication and division operations in signal process...
Venkataraman Mahalingam, N. Ranganathan
WAOA
2010
Springer
256views Algorithms» more  WAOA 2010»
14 years 7 months ago
The Train Delivery Problem - Vehicle Routing Meets Bin Packing
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
Aparna Das, Claire Mathieu, Shay Mozes
DKE
2002
113views more  DKE 2002»
14 years 9 months ago
A general strategy for decomposing topological invariants of spatial databases and an application
Topological invariants of spatial databases (i.e., finite structures that capture the topological properties of the database) are receiving increasing attention since they can act...
Serafino Cicerone, Daniele Frigioni, Paolino Di Fe...
ML
2008
ACM
14 years 9 months ago
A bias/variance decomposition for models using collective inference
Bias/variance analysis is a useful tool for investigating the performance of machine learning algorithms. Conventional analysis decomposes loss into errors due to aspects of the le...
Jennifer Neville, David Jensen