Sciweavers

1458 search results - page 30 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
HPDC
2000
IEEE
14 years 26 days ago
dQUOB: Managing Large Data Flows using Dynamic Embedded Queries
The dQUOB system satis es client need for speci c information from high-volume data streams. The data streams we speak of are the ow of data existing during large-scale visualizat...
Beth Plale, Karsten Schwan
ICML
2006
IEEE
14 years 9 months ago
Practical solutions to the problem of diagonal dominance in kernel document clustering
In supervised kernel methods, it has been observed that the performance of the SVM classifier is poor in cases where the diagonal entries of the Gram matrix are large relative to ...
Derek Greene, Padraig Cunningham
TVCG
2012
185views Hardware» more  TVCG 2012»
11 years 11 months ago
Interest Driven Navigation in Visualization
—This paper describes a new method to explore and discover within a large data set. We apply techniques from preference elicitation to automatically identify data elements that a...
Christopher G. Healey, Brent M. Dennis
IS
2007
13 years 8 months ago
Browsing large online data tables using generalized query previews
Companies, government agencies, and other organizations are making their data available to the world over the Internet. They often use large online relational tables for this purp...
Egemen Tanin, Ben Shneiderman, Hairuo Xie
OSDI
2004
ACM
14 years 8 months ago
CP-Miner: A Tool for Finding Copy-paste and Related Bugs in Operating System Code
Copy-pasted code is very common in large software because programmers prefer reusing code via copy-paste in order to reduce programming effort. Recent studies show that copy-paste...
Zhenmin Li, Shan Lu, Suvda Myagmar, Yuanyuan Zhou