Sciweavers

1096 search results - page 148 / 220
» A New Approach for Speeding Up Enumeration Algorithms
Sort
View
SAS
2004
Springer
105views Formal Methods» more  SAS 2004»
15 years 5 months ago
Type Inference Against Races
Abstract. The race condition checker rccjava uses a formal type system to statically identify potential race conditions in concurrent Java programs, but it requires programmer-supp...
Cormac Flanagan, Stephen N. Freund
ICCAD
1993
IEEE
134views Hardware» more  ICCAD 1993»
15 years 4 months ago
Beyond the combinatorial limit in depth minimization for LUT-based FPGA designs
In this paper, we present an integrated approach to synthesis and mapping to go beyond the combinatorial limit set up by the depth-optimal FlowMap algorithm. The new algorithm, na...
Jason Cong, Yuzheng Ding
CORR
2010
Springer
200views Education» more  CORR 2010»
14 years 12 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...
ICDE
2012
IEEE
212views Database» more  ICDE 2012»
13 years 2 months ago
Attribute-Based Subsequence Matching and Mining
—Sequence analysis is very important in our daily life. Typically, each sequence is associated with an ordered list of elements. For example, in a movie rental application, a cus...
Yu Peng, Raymond Chi-Wing Wong, Liangliang Ye, Phi...
LCTRTS
2007
Springer
15 years 6 months ago
External memory page remapping for embedded multimedia systems
As memory speeds and bus capacitances continue to rise, external memory bus power will make up an increasing portion of the total system power budget for system-on-a-chip embedded...
Ke Ning, David R. Kaeli