Sciweavers

336 search results - page 25 / 68
» Improved data structures for fully dynamic biconnectivity
Sort
View
CORR
1999
Springer
118views Education» more  CORR 1999»
14 years 11 months ago
Supervised Grammar Induction Using Training Data with Limited Constituent Information
Corpus-based grammar induction generally relies on hand-parsed training data to learn the structure of the language. Unfortunately, the cost of building large annotated corpora is...
Rebecca Hwa
CPM
2006
Springer
182views Combinatorics» more  CPM 2006»
15 years 3 months ago
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
Johannes Fischer, Volker Heun
CASES
2008
ACM
15 years 1 months ago
Efficient code caching to improve performance and energy consumption for java applications
Java applications rely on Just-In-Time (JIT) compilers or adaptive compilers to generate and optimize binary code at runtime to boost performance. In conventional Java Virtual Mac...
Yu Sun, Wei Zhang
DATASCIENCE
2002
71views more  DATASCIENCE 2002»
14 years 11 months ago
An integrated web resource for crystallography
A recurring theme during the CODATA 2000 conference (Lake Maggiore, Italy, 15 - 19 October 2000) was the increasing convergence in data-rich branches of science between the storag...
Brian McMahon
SIAMSC
2010
132views more  SIAMSC 2010»
14 years 6 months ago
Some Improvements for the Fast Sweeping Method
In this paper, we outline two improvements to the fast sweeping method to improve the speed of the method in general and more specifically in cases where the speed is changing rapi...
Stanley Bak, Joyce R. McLaughlin, Daniel Renzi