5606 search results - page 319 / 1122 » Randomization Techniques for Graphs. |
162
click to vote
DRM
2007
Springer
16 years 23 days ago
2007
Springer
We present a new technique for generating biometric fingerprint hashes, or summaries of information contained in human fingerprints. Our method calculates and aggregates various...
171
click to vote
SAT
2005
Springer
16 years 2 days ago
2005
Springer
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
157
click to vote
SAC
2004
ACM
16 years 11 hour ago
2004
ACM
It is increasingly important to optimally select base stations in the design of cellular networks, as customers demand cheaper and better wireless services. From a set of potentia...
142
click to vote
COLT
2003
Springer
15 years 11 months ago
2003
Springer
A mere bounded number of random bits judiciously employed by a probabilistically correct algorithmic coordinator is shown to increase the power of learning to coordinate compared ...
204
click to vote
EMMCVPR
2001
Springer
15 years 11 months ago
2001
Springer
To segregate overlapping objects into depth layers requires the integration of local occlusion cues distributed over the entire image into a global percept. We propose to model thi...