1002 search results - page 126 / 201 » Towards Graph Programs for Graph Algorithms |
139
click to vote
FSTTCS
2009
Springer
15 years 9 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
126
click to vote
CEC
2007
IEEE
2007
IEEE
Mining association rules from databases with continuous attributes using genetic network programming
15 years 6 months ago
Most association rule mining algorithms make use of discretization algorithms for handling continuous attributes. Discretization is a process of transforming a continuous attribute...
121
click to vote
OOPSLA
2010
Springer
15 years 27 days ago
2010
Springer
Given a high-level specification and a low-level programming language, our goal is to automatically synthesize an efficient program that meets the specification. In this paper,...
280
click to vote
INFOCOM
2005
IEEE
15 years 8 months ago
2005
IEEE
Abstract— We present a model for the joint design of congestion control and media access control (MAC) for ad hoc wireless networks. Using contention graph and contention matrix,...
130
Voted
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...