Sciweavers

18306 search results - page 438 / 3662
» Algorithmics in Exponential Time
Sort
View
SPIRE
2009
Springer
16 years 2 months ago
A Linear-Time Burrows-Wheeler Transform Using Induced Sorting
To compute Burrows-Wheeler Transform (BWT), one usually builds a suffix array (SA) first, and then obtains BWT using SA, which requires much redundant working space. In previous ...
Daisuke Okanohara, Kunihiko Sadakane
230
Voted
FOCS
1991
IEEE
15 years 11 months ago
Computing Sums of Radicals in Polynomial Time
For sums of radicals Pk i=1 i di p i, where i; i are elements of some real algebraic number eld Q( ); di p i 2 R; we present a deterministic polynomial time algorithm to decide wh...
Johannes Blömer
AAAI
1994
15 years 8 months ago
Automated Modeling for Answering Prediction Questions: Selecting the Time Scale and System Boundary
The ability to answer prediction questions is crucial to reasoning about physical systems. A prediction question poses a hypothetical scenario and asks for the resulting behavior ...
Jeff Rickel, Bruce W. Porter
TMI
2008
67views more  TMI 2008»
15 years 7 months ago
A Fast Method for Designing Time-Optimal Gradient Waveforms for Arbitrary k-Space Trajectories
A fast and simple algorithm for designing time-optimal waveforms is presented. The algorithm accepts a given arbitrary multi-dimensional k-space trajectory as the input and outputs...
Michael Lustig, Seung-Jean Kim, John M. Pauly
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 7 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore