Sciweavers

1333 search results - page 89 / 267
» Categorial Minimalism
Sort
View
POPL
2009
ACM
14 years 11 months ago
Relaxed memory models: an operational approach
Memory models define an interface between programs written in some language and their implementation, determining which behaviour the memory (and thus a program) is allowed to hav...
Gérard Boudol, Gustavo Petri
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
14 years 11 months ago
A constant-factor approximation for stochastic Steiner forest
We consider the stochastic Steiner forest problem: suppose we were given a collection of Steiner forest instances, and were guaranteed that a random one of these instances would a...
Anupam Gupta, Amit Kumar
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
14 years 11 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
SIGCSE
2009
ACM
150views Education» more  SIGCSE 2009»
14 years 11 months ago
Dereferee: exploring pointer mismanagement in student code
Dynamic memory management and the use of pointers are critical topics in teaching the C++ language. They are also some of the most difficult for students to grasp properly. The re...
Anthony Allevato, Manuel A. Pérez-Qui&ntild...
KDD
2009
ACM
202views Data Mining» more  KDD 2009»
14 years 11 months ago
Correlated itemset mining in ROC space: a constraint programming approach
Correlated or discriminative pattern mining is concerned with finding the highest scoring patterns w.r.t. a correlation measure (such as information gain). By reinterpreting corre...
Siegfried Nijssen, Tias Guns, Luc De Raedt