2719 search results - page 286 / 544 » Exposing Application Alternatives |
198
click to vote
CONSTRAINTS
2008
15 years 6 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
173
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We investigate a biologically motivated approach to fast visual classification, directly inspired by the recent work [13]. Specifically, trading-off biological accuracy for comput...
165
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In this paper new, lightweight security and control protocol for Voice over Internet Protocol (VoIP) service is presented. It is the alternative for the IETF's (Internet Engi...
155
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
159
click to vote
DAM
2006
15 years 6 months ago
2006
Abstract. Artin's braid groups currently provide a promising background for cryptographical applications, since the first cryptosystems using braids were introduced in [2, 3, ...