2638 search results - page 290 / 528 » Random Geometric Complexes |
174
click to vote
STOC
2006
ACM
16 years 15 days ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
195
click to vote
FSE
2005
Springer
16 years 2 days ago
2005
Springer
In this paper we present a distinguisher targeting towards irregularly clocked filter generators. The attack is applied on the irregularly clocked stream cipher called LILI-II. LI...
184
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...
182
click to vote
IBPRIA
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. This paper presents a general framework to segment curvilinear objects in 2D images. A pre-processing step relies on mathematical morphology to obtain a connected line wh...
160
click to vote
ASPDAC
1998
ACM
15 years 10 months ago
1998
ACM
−This paper describes a new redundant fault identification algorithm with Exclusive-OR circuit reduction. The experimental results using this algorithm with a FAN-based test patt...