1816 search results - page 168 / 364 » A New Approach for Solving the Maximum Clique Problem |
141
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
— Finding low-weight multiples of a binary polynomial is a difficult problem arising in the context of stream ciphers cryptanalysis. The best algorithms to solve this problem ar...
181
click to vote
EUROCRYPT
2004
Springer
15 years 12 months ago
2004
Springer
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
160
click to vote
NIPS
2007
15 years 8 months ago
2007
A novel approach to measure the interdependence of two time series is proposed, referred to as “stochastic event synchrony” (SES); it quantifies the alignment of two point pr...
170
click to vote
WCE
2007
15 years 7 months ago
2007
—A dramatic and continuous increase in the complexity and size of websites on the Internet makes rather difficult to build such websites with required information to be easily fo...
166
click to vote
AIPS
2008
15 years 8 months ago
2008
In this paper, we consider the problem of assisting a busy user in managing her workload of pending tasks. We assume that our user is typically oversubscribed, and is invariably j...