Sciweavers

600 search results - page 78 / 120
» Problems and results in extremal combinatorics - II
Sort
View
COGSCI
2010
111views more  COGSCI 2010»
13 years 9 months ago
Mechanisms of Cognitive Development: Domain-General Learning or Domain-Specific Constraints?
many abstract categories (e.g., ``equivalence'') is innate. Although Plato argued with his contemporaries who advocated the empirical basis of knowledge, it was the Briti...
Vladimir Sloutsky
SIAMCOMP
2000
101views more  SIAMCOMP 2000»
13 years 9 months ago
Motion Planning of Legged Robots
We study the problem of computing the free space F of a simple legged robot called the spider robot. The body of this robot is a single point and the legs are attached to the body....
Jean-Daniel Boissonnat, Olivier Devillers, Sylvain...
ICWSM
2009
13 years 7 months ago
Targeting Sentiment Expressions through Supervised Ranking of Linguistic Configurations
User generated content is extremely valuable for mining market intelligence because it is unsolicited. We study the problem of analyzing users' sentiment and opinion in their...
Jason S. Kessler, Nicolas Nicolov
SIGMETRICS
2008
ACM
106views Hardware» more  SIGMETRICS 2008»
13 years 9 months ago
Fully decentralized emulation of best-effort and processor sharing queues
Control of large distributed cloud-based services is a challenging problem. The Distributed Rate Limiting (DRL) paradigm was recently proposed as a mechanism for tackling this pro...
Rade Stanojevic, Robert Shorten
CRYPTO
2006
Springer
119views Cryptology» more  CRYPTO 2006»
14 years 29 days ago
Rankin's Constant and Blockwise Lattice Reduction
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
Nicolas Gama, Nick Howgrave-Graham, Henrik Koy, Ph...