4095 search results - page 416 / 819 » How to test a tree |
164
click to vote
PADS
1997
ACM
15 years 10 months ago
1997
ACM
This paper is a reminder of the danger of allowing \risk" when synchronizing a parallel discrete-event simulation: a simulation code that runs correctly on a serial machine m...
178
click to vote
VLSID
2006
IEEE
16 years 5 days ago
2006
IEEE
This tutorial present the key aspects of design challenges and its solutions that are being experienced in VLSI design in the era of nano technology. The focus will be on design c...
157
click to vote
ADMA
2005
Springer
15 years 11 months ago
2005
Springer
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
162
click to vote
CIKM
2005
Springer
15 years 11 months ago
2005
Springer
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
179
click to vote
ICDT
2001
ACM
15 years 10 months ago
2001
ACM
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...