Sciweavers

124 search results - page 14 / 25
» Calculating cyclotomic polynomials
Sort
View
COMPGEOM
2001
ACM
13 years 11 months ago
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
14 years 8 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
ISSAC
1997
Springer
157views Mathematics» more  ISSAC 1997»
13 years 12 months ago
On the Worst-case Complexity of Integer Gaussian Elimination
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...
Xin Gui Fang, George Havas
AAAI
2006
13 years 9 months ago
Overlapping Coalition Formation for Efficient Data Fusion in Multi-Sensor Networks
This paper develops new algorithms for coalition formation within multi-sensor networks tasked with performing widearea surveillance. Specifically, we cast this application as an ...
Viet Dung Dang, Rajdeep K. Dash, Alex Rogers, Nich...
ASPDAC
2010
ACM
211views Hardware» more  ASPDAC 2010»
13 years 5 months ago
A fast analog mismatch analysis by an incremental and stochastic trajectory piecewise linear macromodel
To cope with an increasing complexity when analyzing analog mismatch in sub-90nm designs, this paper presents a fast non-MonteCarlo method to calculate mismatch in time domain. Th...
Hao Yu, Xuexin Liu, Hai Wang, Sheldon X.-D. Tan