Sciweavers

1763 search results - page 250 / 353
» Dependent random choice
Sort
View
EUROSYS
2006
ACM
16 years 2 months ago
On the road to recovery: restoring data after disasters
—Restoring data operations after a disaster is a daunting task: how should recovery be performed to minimize data loss and application downtime? Administrators are under consider...
Kimberly Keeton, Dirk Beyer 0002, Ernesto Brau, Ar...
136
Voted
INFOCOM
2009
IEEE
16 years 5 days ago
Mobility-Driven Scheduling in Wireless Networks
—The design of scheduling policies for wireless data systems has been driven by a compromise between the objectives of high overall system throughput and the degree of fairness a...
Sem C. Borst, Nidhi Hegde, Alexandre Proutiere
148
Voted
CONCUR
2009
Springer
16 years 2 days ago
Probabilistic Weighted Automata
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
ICC
2008
IEEE
167views Communications» more  ICC 2008»
15 years 12 months ago
Traceroute-Based Topology Inference without Network Coordinate Estimation
Abstract— Underlay topology information is important to construct efficient overlay networks. To achieve end-to-end network topology inference among a group of hosts, traceroute...
Xing Jin, Wanqing Tu, S.-H. Gary Chan
ICDM
2008
IEEE
137views Data Mining» more  ICDM 2008»
15 years 12 months ago
Iterative Set Expansion of Named Entities Using the Web
Set expansion refers to expanding a partial set of “seed” objects into a more complete set. One system that does set expansion is SEAL (Set Expander for Any Language), which e...
Richard C. Wang, William W. Cohen