Sciweavers

2693 search results - page 128 / 539
» On Computing Complex Navigation Functions
Sort
View
111
Voted
COLT
2005
Springer
15 years 8 months ago
Learnability of Bipartite Ranking Functions
The problem of ranking, in which the goal is to learn a real-valued ranking function that induces a ranking or ordering over an instance space, has recently gained attention in mac...
Shivani Agarwal, Dan Roth
141
Voted
ATAL
2009
Springer
15 years 9 months ago
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
Tammar Shrot, Yonatan Aumann, Sarit Kraus
142
Voted
ECCC
2007
123views more  ECCC 2007»
15 years 2 months ago
Lossy Trapdoor Functions and Their Applications
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
Chris Peikert, Brent Waters
118
Voted
ARITH
2009
IEEE
15 years 9 months ago
A Dual-Purpose Real/Complex Logarithmic Number System ALU
—The real Logarithmic Number System (LNS) allows fast and inexpensive multiplication and division but more expensive addition and subtraction as precision increases. Recent advan...
Mark G. Arnold, Sylvain Collange
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
15 years 6 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....