6829 search results - page 1202 / 1366 » Quantitative Generalizations of Languages |
110
Voted
SIGIR
2005
ACM
15 years 9 months ago
2005
ACM
This paper explores probabilistic lexico-syntactic pattern matching, also known as soft pattern matching. While previous methods in soft pattern matching are ad hoc in computing t...
123
Voted
STORAGESS
2005
ACM
15 years 9 months ago
2005
ACM
Improper access of data buffers is one of the most common errors in programs written in assembler, C, C++, and several other languages. Existing programs and OSs frequently acces...
107
Voted
TLDI
2005
ACM
15 years 9 months ago
2005
ACM
Coordinated data structures are sets of (perhaps unbounded) data structures where the nodes of each structure may share types with the corresponding nodes of the other structures....
142
Voted
VEE
2005
ACM
15 years 9 months ago
2005
ACM
Modern transactional response-time sensitive applications have run into practical limits on the size of garbage collected heaps. The heap can only grow until GC pauses exceed the ...
170
Voted
VEE
2005
ACM
15 years 9 months ago
2005
ACM
We present an optimized implementation of the linear scan register allocation algorithm for Sun Microsystems’ Java HotSpotTM client compiler. Linear scan register allocation is ...