Sciweavers

1888 search results - page 282 / 378
» Proof theory and computational analysis
Sort
View
SIGCSE
2008
ACM
166views Education» more  SIGCSE 2008»
15 years 1 months ago
Defense against the dark arts
Computer science faculty must attract and retain students by offering innovative courses that spark student interest, yet still teach core, computer science concepts. These effort...
Mark W. Bailey, Clark L. Coleman, Jack W. Davidson
PODS
2008
ACM
211views Database» more  PODS 2008»
16 years 1 months ago
The power of two min-hashes for similarity search among hierarchical data objects
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...
Sreenivas Gollapudi, Rina Panigrahy
ATAL
2009
Springer
15 years 8 months ago
False name manipulations in weighted voting games: splitting, merging and annexation
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
Haris Aziz, Mike Paterson
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
15 years 7 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
PODC
2010
ACM
15 years 5 months ago
A new technique for distributed symmetry breaking
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
Johannes Schneider, Roger Wattenhofer