1688 search results - page 122 / 338 » The Complexity of Rationalizing Matchings |
175
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
177
click to vote
ICASSP
2008
IEEE
16 years 7 days ago
2008
IEEE
Recently, significant attention in compressed sensing has been focused on Basis Pursuit, exchanging the cardinality operator with the l1-norm, which leads to a linear formulation...
171
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
Most previous schema mapping works focus on creating mappings in specific data models for data transformation, failing to capture a richer set of possible relationships between sc...
160
click to vote
WWW
2009
ACM
16 years 6 months ago
2009
ACM
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
164
Voted
ICCAD
2003
IEEE
16 years 2 months ago
2003
IEEE
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...