457 search results - page 86 / 92 » A relative trust-region algorithm for independent component ... |
IEEESP
2007
14 years 9 months ago
2007
igh level of abstraction and to provide broad oversight. In contrast, the goal of computer science security education is to provide the technicalexpertisetodevelopsecure software a...
STOC
2010
ACM
14 years 9 months ago
2010
ACM
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
83
Voted
SIAMDM
2008
14 years 9 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
CIVR
2009
Springer
15 years 4 months ago
2009
Springer
Semantic concept detectors are often individually and independently developed. Using peripherally related concepts for leveraging the power of joint detection, which is referred t...