Sciweavers

4488 search results - page 859 / 898
» Properties of NP-Complete Sets
Sort
View
USENIX
2001
13 years 9 months ago
The X Resize and Rotate Extension - RandR
The X Window System protocol, Version 11, was deliberately designed to be extensible, to provide for both anticipated and unanticipated needs. The X11 core did not anticipate that...
Jim Gettys, Keith Packard
USENIX
2001
13 years 9 months ago
A Waypoint Service Approach to Connect Heterogeneous Internet Address Spaces
The rapid growth of the Internet has made IP addresses a scarce resource. To get around this problem, today and in the foreseeable future, networks will be deployed with reusable-...
T. S. Eugene Ng, Ion Stoica, Hui Zhang
SODA
2004
ACM
102views Algorithms» more  SODA 2004»
13 years 9 months ago
The hyperring: a low-congestion deterministic data structure for distributed environments
In this paper we study the problem of designing concurrent searchable data structures with performance guarantees that can be used in a distributed environment where data elements...
Baruch Awerbuch, Christian Scheideler
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
13 years 9 months ago
Reconstructing strings from random traces
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andre...
UAI
2004
13 years 9 months ago
Active Model Selection
Classical learning assumes the learner is given a labeled data sample, from which it learns a model. The field of Active Learning deals with the situation where the learner begins...
Omid Madani, Daniel J. Lizotte, Russell Greiner