Sciweavers

1224 search results - page 232 / 245
» Theory decision by decomposition
Sort
View
FOCS
2005
IEEE
14 years 4 months ago
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
Noga Alon, Asaf Shapira
SSDBM
2005
IEEE
100views Database» more  SSDBM 2005»
14 years 4 months ago
An Information Theoretic Model for Database Alignment
As with many large organizations, the Government's data is split in many different ways and is collected at different times by different people. The resulting massive data he...
Patrick Pantel, Andrew Philpot, Eduard H. Hovy
PODC
2005
ACM
14 years 4 months ago
Adaptive routing with stale information
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, an infinite n...
Simon Fischer, Berthold Vöcking
SIGCOMM
2005
ACM
14 years 4 months ago
Implications of autonomy for the expressiveness of policy routing
Thousands of competing autonomous systems must cooperate with each other to provide global Internet connectivity. Each autonomous system (AS) encodes various economic, business, a...
Nick Feamster, Ramesh Johari, Hari Balakrishnan
SIGECOM
2005
ACM
169views ECommerce» more  SIGECOM 2005»
14 years 4 months ago
Online auctions with re-usable goods
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mo...