Sciweavers

7840 search results - page 338 / 1568
» On generalized Ramsey numbers
Sort
View
SPAA
2004
ACM
16 years 8 days ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
ICLP
2004
Springer
16 years 6 days ago
MProlog: An Extension of Prolog for Modal Logic Programming
We introduce our implemented modal logic programming system MProlog. This system is written in Prolog as a module for Prolog. Codes, libraries, and most features of Prolog can be u...
Linh Anh Nguyen
IJCAI
1989
15 years 8 months ago
A Critique of the Valiant Model
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...
Wray L. Buntine
CORR
2010
Springer
109views Education» more  CORR 2010»
15 years 7 months ago
Polynomial Learning of Distribution Families
Abstract--The question of polynomial learnability of probability distributions, particularly Gaussian mixture distributions, has recently received significant attention in theoreti...
Mikhail Belkin, Kaushik Sinha
CORR
2006
Springer
90views Education» more  CORR 2006»
15 years 6 months ago
About the Lifespan of Peer to Peer Networks
In this paper we analyze the ability of peer to peer networks to deliver a complete file among the peers. Early on we motivate a broad generalization of network behavior organizing...
Rudi Cilibrasi, Zvi Lotker, Alfredo Navarra, St&ea...