Sciweavers

923 search results - page 42 / 185
» Factorizing Languages
Sort
View
83
Voted
ICALP
1994
Springer
15 years 1 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
VL
2009
IEEE
131views Visual Languages» more  VL 2009»
15 years 4 months ago
Attitudes and self-efficacy in young adults' computing autobiographies
Little is known about the formation of people’s first perceptions about computers and computer code, yet it is likely that these impressions have a lasting effect on peoples’ ...
Andrew J. Ko
83
Voted
WINE
2007
Springer
132views Economy» more  WINE 2007»
15 years 3 months ago
Adwords Auctions with Decreasing Valuation Bids
The choice of a bidding language is crucial in auction design in order to correctly capture bidder utilities. We propose a new bidding model for the Adwords auctions of search eng...
Gagan Goel, Aranyak Mehta
EACL
1993
ACL Anthology
14 years 11 months ago
A Tradeoff between Compositionality and Complexity in the Semantics of Dimensional Adjectives
Linguistic access to uncertain quantitative knowledge about physical properties is provided by dimensional adjectives, e.g. long-short in the spatial and temporal senses, near-far...
Geoffrey Simmons
JMLR
2012
13 years 4 days ago
Sparse Higher-Order Principal Components Analysis
Traditional tensor decompositions such as the CANDECOMP / PARAFAC (CP) and Tucker decompositions yield higher-order principal components that have been used to understand tensor d...
Genevera Allen