Sciweavers

11345 search results - page 1808 / 2269
» Foundations of Computer Science
Sort
View
MFCS
2009
Springer
15 years 11 months ago
Branching Programs for Tree Evaluation
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
ACMSE
2009
ACM
15 years 11 months ago
Applying randomized projection to aid prediction algorithms in detecting high-dimensional rogue applications
This paper describes a research effort to improve the use of the cosine similarity information retrieval technique to detect unknown, known or variances of known rogue software by...
Travis Atkison
IMC
2009
ACM
15 years 11 months ago
Scalable proximity estimation and link prediction in online social networks
Proximity measures quantify the closeness or similarity between nodes in a social network and form the basis of a range of applications in social sciences, business, information t...
Han Hee Song, Tae Won Cho, Vacha Dave, Yin Zhang, ...
ACSC
2008
IEEE
15 years 11 months ago
HOVER: hybrid on-demand distance vector routing for wireless mesh networks
Abstract— Hybrid Wireless Mesh Networks are a combination of mobile ad hoc networks and infrastructure wireless mesh networks, consisting of two types of nodes: Mobile Mesh Clien...
Stephan Mir, Asad Amir Pirzada, Marius Portmann
ACSC
2008
IEEE
15 years 11 months ago
On illegal composition of first-class agent interaction protocols
In this paper, we examine the composition of firstclass protocols for multi-agent systems. First-class protocols are protocols that exist as executable specifications that agent...
Tim Miller, Peter McBurney
« Prev « First page 1808 / 2269 Last » Next »