Sciweavers

9842 search results - page 1337 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
236
Voted
IACR
2011
111views more  IACR 2011»
14 years 7 months ago
Secure Multi-Party Sorting and Applications
Sorting is among the most fundamental and well-studied problems within computer science and a core step of many algorithms. In this article, we consider the problem of constructing...
Kristján Valur Jónsson, Gunnar Kreit...
ICC
2011
IEEE
201views Communications» more  ICC 2011»
14 years 6 months ago
Survivable Optical Grid Dimensioning: Anycast Routing with Server and Network Failure Protection
Abstract—Grids can efficiently deal with challenging computational and data processing tasks which cutting edge science is generating today. So-called e-Science grids cope with ...
Chris Develder, Jens Buysse, Ali Shaikh, Brigitte ...
AVI
2010
15 years 8 months ago
Advanced visual analytics interfaces
Advanced visual interfaces, like the ones found in informaualization, intend to offer a view on abstract data spaces to enable users to make sense of them. By mapping data to visu...
Daniel A. Keim, Peter Bak, Enrico Bertini, Daniela...
249
Voted
CORR
2012
Springer
170views Education» more  CORR 2012»
14 years 3 months ago
What Cannot be Learned with Bethe Approximations
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
Uri Heinemann, Amir Globerson
190
Voted
PPOPP
2012
ACM
14 years 2 months ago
Synchronization views for event-loop actors
The actor model has already proven itself as an interesting concurrency model that avoids issues such as deadlocks and race conditions by construction, and thus facilitates concur...
Joeri De Koster, Stefan Marr, Theo D'Hondt
« Prev « First page 1337 / 1969 Last » Next »