Sciweavers

662 search results - page 7 / 133
» A comparative benchmark of large objects in relational datab...
Sort
View
CAD
2006
Springer
13 years 7 months ago
Developing an engineering shape benchmark for CAD models
Three-dimensional shape retrieval is a problem of current interest in several different fields, especially in the mechanical engineering domain. There exists a large body of work ...
Subramaniam Jayanti, Yagnanarayanan Kalyanaraman, ...
ICDM
2009
IEEE
134views Data Mining» more  ICDM 2009»
13 years 5 months ago
Efficient Discovery of Confounders in Large Data Sets
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...
Wenjun Zhou, Hui Xiong
IPTPS
2003
Springer
14 years 22 days ago
Structured Peer-to-Peer Overlays Need Application-Driven Benchmarks
Considerable research effort has recently been devoted to the design of structured peer-to-peer overlays, a term we use to encompass Content-Addressable Networks (CANs), Distribut...
Sean C. Rhea, Timothy Roscoe, John Kubiatowicz
DAC
1994
ACM
13 years 11 months ago
Partitioning Very Large Circuits Using Analytical Placement Techniques
A new partitioningapproach for very largecircuits is described. We demonstrate that applying a recently developed analytical placement algorithm, that pro ts from a linear objecti...
Bernhard M. Riess, Konrad Doll, Frank M. Johannes
RSCTC
2000
Springer
143views Fuzzy Logic» more  RSCTC 2000»
13 years 11 months ago
On Efficient Construction of Decision Trees from Large Databases
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
Hung Son Nguyen