Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
15375
search results - page 9 / 3075
»
cans 2008
Sort
relevance
views
votes
recent
update
View
thumb
title
85
click to vote
SIGECOM
2008
ACM
129
views
ECommerce
»
more
SIGECOM 2008
»
Can priced options solve the exposure problem in sequential auctions?
15 years 3 months ago
Download
www.sigecom.org
Lonneke Mous, Valentin Robu, Han La Poutré
claim paper
Read More »
99
click to vote
PUC
2008
93
views
more
PUC 2008
»
Transports of delight? What the experience of receiving (mobile) phone calls can tell us about design
15 years 2 months ago
Download
shura.shu.ac.uk
Ann Light
claim paper
Read More »
124
Voted
DCG
2006
69
views
more
DCG 2006
»
How Neighborly Can a Centrally Symmetric Polytope Be?
15 years 3 months ago
Download
www.math.washington.edu
Abstract. We show that there exist k-neighborly centrally symmetric ddimensional polytopes with 2(n + d) vertices, where k(d, n) = ,, d 1 + log((d + n)/d)
Nathan Linial, Isabella Novik
claim paper
Read More »
87
Voted
FOCS
2008
IEEE
125
views
Theoretical Computer Science
»
more
FOCS 2008
»
Elections Can be Manipulated Often
15 years 10 months ago
Download
www.ratio.huji.ac.il
Ehud Friedgut, Gil Kalai, Noam Nisan
claim paper
Read More »
65
Voted
HICSS
2008
IEEE
87
views
Biometrics
»
more
HICSS 2008
»
How Many Attackers Can Selfish Defenders Catch?
15 years 10 months ago
Download
csdl2.computer.org
Marios Mavronicolas, Burkhard Monien, Vicky G. Pap...
claim paper
Read More »
« Prev
« First
page 9 / 3075
Last »
Next »