Sciweavers

4526 search results - page 29 / 906
» Algorithmic problems related to the Internet
Sort
View
SEMWEB
2005
Springer
14 years 2 months ago
Representing Probabilistic Relations in RDF
Probabilistic inference will be of special importance when one needs to know how much we can say with what all we know given new observations. Bayesian Network is a graphical prob...
Yoshio Fukushige
PAM
2004
Springer
14 years 2 months ago
Geometric Exploration of the Landmark Selection Problem
Abstract. Internet coordinate systems appear promising as a method for estimating network distance without direct measurement, allowing scalable configuration of emerging applicat...
Liying Tang, Mark Crovella
ICC
2009
IEEE
150views Communications» more  ICC 2009»
14 years 3 months ago
Optimum Internet Gateway Selection in Ad Hoc Networks
—Wireless ad hoc networks are connected to the fixed Internet by means of Internet gateways. Whenever a node within the ad hoc network wishes to communicate with a host in the I...
Felix Hoffmann, Daniel Medina
ICSE
2007
IEEE-ACM
14 years 8 months ago
A Discreet, Fault-Tolerant, and Scalable Software Architectural Style for Internet-Sized Networks
Large networks, such as the Internet, pose an ideal medium for solving computationally intensive problems, such as NP-complete problems, yet no well-scaling architecture for Inter...
Yuriy Brun
ICML
2003
IEEE
14 years 9 months ago
Learning Distance Functions using Equivalence Relations
We address the problem of learning distance metrics using side-information in the form of groups of "similar" points. We propose to use the RCA algorithm, which is a sim...
Aharon Bar-Hillel, Tomer Hertz, Noam Shental, Daph...