Sciweavers

672 search results - page 45 / 135
» Words and forbidden factors
Sort
View
FOCS
2004
IEEE
15 years 3 months ago
Hardness of Approximating the Shortest Vector Problem in Lattices
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
Subhash Khot
JTAER
2007
90views more  JTAER 2007»
14 years 11 months ago
One-size e-business adoption model does not fit all
This empirical study of organisational e-business adoption, utilising both qualitative and quantitative data collection methods, examines four major factors influencing adoption i...
Barbara Roberts, Mark Toleman
MLMI
2007
Springer
15 years 6 months ago
Using Prosodic Features in Language Models for Meetings
Abstract. Prosody has been actively studied as an important knowledge source for speech recognition and understanding. In this paper, we are concerned with the question of exploiti...
Songfang Huang, Steve Renals
ASSETS
2009
ACM
15 years 4 months ago
Better vocabularies for assistive communication aids: connecting terms using semantic networks and untrained annotators
The difficulties of navigating vocabulary in an assistive communication device are exacerbated for individuals with lexical access disorders like those due to aphasia. We present ...
Sonya S. Nikolova, Jordan L. Boyd-Graber, Christia...
INFORMATICALT
2007
104views more  INFORMATICALT 2007»
14 years 11 months ago
Key Agreement Protocol (KAP) Using Conjugacy and Discrete Logarithm Problems in Group Representation Level
The key agreement protocol based on infinite non-commutative group presentation and representation levels is proposed. Two simultaneous problems in group representation level are ...
Eligijus Sakalauskas, Povilas Tvarijonas, Andrius ...