Sciweavers

9842 search results - page 1708 / 1969
» Problem complexity
Sort
View
JVCA
2007
128views more  JVCA 2007»
15 years 6 months ago
Impulse-based dynamic simulation in linear time
This paper describes an impulse-based dynamic simulation method for articulated bodies which has a linear time complexity. Existing linear-time methods are either based on a reduc...
Jan Bender
TWC
2008
150views more  TWC 2008»
15 years 6 months ago
Design and analysis of post-coded OFDM systems
This paper discusses the design and analysis of post coded OFDM (PC-OFDM) systems. Coded or precoded OFDM systems are generally employed to overcome the symbol recovery problem in...
S. F. A. Shah, Ahmed H. Tewfik
AIR
2002
125views more  AIR 2002»
15 years 6 months ago
Interactive Critiquing for Catalog Navigation in E-Commerce
E-commerce sites can have large, essentially unbounded, catalogs. With large catalogs comes increasing difficulty for buyers in making use of standard search and browsing faciliti...
Robin D. Burke
LOGCOM
2007
115views more  LOGCOM 2007»
15 years 6 months ago
The Dynamics of Syntactic Knowledge
The syntactic approach to epistemic logic avoids the logical omniscience problem by taking knowledge as primary rather than as defined in terms of possible worlds. In this study, ...
Thomas Ågotnes, Natasha Alechina
LOGCOM
2007
89views more  LOGCOM 2007»
15 years 6 months ago
Algorithmic Randomness of Closed Sets
We investigate notions of randomness in the space C[2N ] of nonempty closed subsets of {0, 1}N . A probability measure is given and a version of the Martin-L¨of test for randomne...
George Barmpalias, Paul Brodhead, Douglas Cenzer, ...
« Prev « First page 1708 / 1969 Last » Next »