Sciweavers

478 search results - page 48 / 96
» Monads of Regular Theories
Sort
View
SODA
2012
ACM
200views Algorithms» more  SODA 2012»
13 years 1 months ago
Optimal crowdsourcing contests
We study the design and approximation of optimal crowdsourcing contests. Crowdsourcing contests can be modeled as all-pay auctions because entrants must exert effort up-front to e...
Shuchi Chawla, Jason D. Hartline, Balasubramanian ...
ICFP
2008
ACM
15 years 11 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...
AIRWEB
2007
Springer
15 years 5 months ago
Transductive Link Spam Detection
Web spam can significantly deteriorate the quality of search engines. Early web spamming techniques mainly manipulate page content. Since linkage information is widely used in we...
Dengyong Zhou, Chris Burges, Tao Tao
MFCS
2005
Springer
15 years 4 months ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
Markus Lohrey, Nicole Ondrusch
75
Voted
GLVLSI
2003
IEEE
134views VLSI» more  GLVLSI 2003»
15 years 4 months ago
Information storage capacity of crossbar switching networks
In this work we ask the fundamental question: How many bits of information can be stored in a crossbar switching network? The answer is trivial when the switches of the network ar...
Paul-Peter Sotiriadis