2127 search results - page 414 / 426 » Computing large matchings fast |
ESA
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
CIKM
2006
Springer
13 years 9 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...
COMPSAC
2007
IEEE
13 years 9 months ago
2007
IEEE
The popularity of Service Oriented Computing (SOC) brings a large number of distributed, well-encapsulated and reusable services all over internet, and makes it possible to create...
ICVGIP
2008
13 years 8 months ago
2008
The primitives of point-based representations are independent but are rendered using surfels, which approximate the immediate neighborhood of each point linearly. A large number o...
SDM
2007
SIAM
13 years 8 months ago
2007
SIAM
In many applications, we monitor data obtained from multiple streaming sources for collective decision making. The task presents several challenges. First, data in sensor networks...