Sciweavers

2233 search results - page 283 / 447
» On the Complexity of Theory Curbing
Sort
View
COGSCI
2010
125views more  COGSCI 2010»
13 years 8 months ago
A Probabilistic Computational Model of Cross-Situational Word Learning
Words are the essence of communication: they are the building blocks of any language. Learning the meaning of words is thus one of the most important aspects of language acquisiti...
Afsaneh Fazly, Afra Alishahi, Suzanne Stevenson
MST
2006
149views more  MST 2006»
13 years 8 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
13 years 8 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
TOPLAS
2008
81views more  TOPLAS 2008»
13 years 8 months ago
Size-change termination with difference constraints
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
Amir M. Ben-Amram
DIALM
2010
ACM
194views Algorithms» more  DIALM 2010»
13 years 6 months ago
Prioritized gossip in vehicular networks
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
Alejandro Cornejo, Calvin C. Newport