Sciweavers

2924 search results - page 492 / 585
» Lower Bounds in Distributed Computing
Sort
View
IPPS
2010
IEEE
15 years 2 months ago
PreDatA - preparatory data analytics on peta-scale machines
Peta-scale scientific applications running on High End Computing (HEC) platforms can generate large volumes of data. For high performance storage and in order to be useful to scien...
Fang Zheng, Hasan Abbasi, Ciprian Docan, Jay F. Lo...
ECAI
2010
Springer
15 years 5 months ago
An Empirical Study of the Manipulability of Single Transferable Voting
Abstract. Voting is a simple mechanism to combine together the preferences of multiple agents. Agents may try to manipulate the result of voting by mis-reporting their preferences....
Toby Walsh
CVPR
2006
IEEE
16 years 6 months ago
Escaping local minima through hierarchical model selection: Automatic object discovery, segmentation, and tracking in video
Recently, the generative modeling approach to video segmentation has been gaining popularity in the computer vision community. For example, the flexible sprites framework has been...
Nebojsa Jojic, John M. Winn, Larry Zitnick
PODC
2011
ACM
14 years 7 months ago
Robust network supercomputing without centralized control
Internet supercomputing is becoming an increasingly popular means for harnessing the power of a vast number of interconnected computers. This comes at a cost substantially lower t...
Seda Davtyan, Kishori M. Konwar, Alexander A. Shva...
SIGMETRICS
2012
ACM
257views Hardware» more  SIGMETRICS 2012»
13 years 6 months ago
Fair sampling across network flow measurements
Sampling is crucial for controlling resource consumption by internet traffic flow measurements. Routers use Packet Sampled NetFlow [9], and completed flow records are sampled in...
Nick G. Duffield