Sciweavers

4913 search results - page 621 / 983
» Results and Perspectives of the G
Sort
View
ICDM
2003
IEEE
99views Data Mining» more  ICDM 2003»
16 years 5 days ago
Scalable Model-based Clustering by Working on Data Summaries
The scalability problem in data mining involves the development of methods for handling large databases with limited computational resources. In this paper, we present a two-phase...
Huidong Jin, Man Leung Wong, Kwong-Sak Leung
SP
2003
IEEE
16 years 4 days ago
Hardening Functions for Large Scale Distributed Computations
Many recent large-scale distributed computing applications utilize spare processor cycles of personal computers that are connected to the Internet. The resulting distributed compu...
Doug Szajda, Barry G. Lawson, Jason Owen
ADHOCNOW
2003
Springer
16 years 3 days ago
A Uniform Continuum Model for Scaling of Ad Hoc Networks
This paper models an ad-hoc network as a continuum of nodes, ignoring edge effects, to find how the traffic scales with N, the number of nodes. We obtain expressions for the traffi...
Ernst W. Grundke, A. Nur Zincir-Heywood
FPGA
2003
ACM
116views FPGA» more  FPGA 2003»
16 years 3 days ago
Hardware-assisted simulated annealing with application for fast FPGA placement
To truly exploit FPGAs for rapid turn-around development and prototyping, placement times must be reduced to seconds; latebound, reconfigurable computing applications may demand p...
Michael G. Wrighton, André DeHon
ICTCS
2003
Springer
16 years 2 days ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui