19866 search results - page 3865 / 3974 » Computing all factorizations in *** |
190
click to vote
CASES
2005
ACM
15 years 8 months ago
2005
ACM
Customisable embedded processors are becoming available on the market, thus making it possible for designers to speed up execution of applications by using Application-specific F...
185
click to vote
CIKM
2006
Springer
15 years 8 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
176
click to vote
CODES
2006
IEEE
15 years 8 months ago
2006
IEEE
The lack of memory safety in many popular programming languages, including C and C++, has been a cause for great concern in the realm of software reliability, verification, and mo...
167
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
161
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...