12194 search results - page 2240 / 2439 » Numberings Optimal for Learning |
172
click to vote
OSDI
2006
ACM
16 years 6 months ago
2006
ACM
There are currently two approaches to providing Byzantine-fault-tolerant state machine replication: a replica-based approach, e.g., BFT, that uses communication between replicas t...
190
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
170
click to vote
MOBIHOC
2006
ACM
16 years 6 months ago
2006
ACM
We use a constrained optimization framework to derive fundamental scaling laws for both unstructured sensor networks (which use blind sequential search for querying) and structure...
189
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
144
click to vote
ICDCS
2009
IEEE
16 years 3 months ago
2009
IEEE
A number of network path delay, loss, or bandwidth inference mechanisms have been proposed over the past decade. Concurrently, several network measurement services have been deplo...