Sciweavers

4526 search results - page 732 / 906
» Algorithmic problems related to the Internet
Sort
View
VLDB
1997
ACM
86views Database» more  VLDB 1997»
15 years 8 months ago
Using Probabilistic Information in Data Integration
The goal of a mediator system is to provide users a uniform interface to the multitude of information sources. To translate user queries, given in a mediated schema, to queries on...
Daniela Florescu, Daphne Koller, Alon Y. Levy
ECML
1993
Springer
15 years 8 months ago
Complexity Dimensions and Learnability
In machine learning theory, problem classes are distinguished because of di erences in complexity. In 6 , a stochastic model of learning from examples was introduced. This PAClear...
Shan-Hwei Nienhuys-Cheng, Mark Polman
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
15 years 8 months ago
A coding theorem for distributed computation
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
Sridhar Rajagopalan, Leonard J. Schulman
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
15 years 8 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl
CEC
2007
IEEE
15 years 8 months ago
Mobile robot global localization using differential evolution and particle swarm optimization
For a mobile robot to move in a known environment and operate successfully, first it needs to robustly determine its initial position and orientation relative to the map, and then ...
Ali R. Vahdat, Naser NourAshrafoddin, Saeed Shiry ...