2272 search results - page 292 / 455 » Capture Complexity by Partition |
132
click to vote
EUROCAST
2007
Springer
15 years 9 months ago
2007
Springer
Abstract a paradigm of modern Machine Learning (ML) which uses rewards and punishments to guide the learning process. One of the central ideas of RL is learning by “direct-online...
159
Voted
WADS
2007
Springer
15 years 9 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
128
click to vote
CASES
2006
ACM
15 years 9 months ago
2006
ACM
Architectural advances of modern systems has often been at odds with control complexity, requiring significant effort in both design and verification. This is particularly true ...
154
click to vote
ICS
2004
Tsinghua U.
15 years 8 months ago
2004
Tsinghua U.
Cache hierarchies have been traditionally designed for usage by a single application, thread or core. As multi-threaded (MT) and multi-core (CMP) platform architectures emerge and...
140
Voted
ASUNAM
2010
IEEE
15 years 5 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...