Sciweavers

1458 search results - page 223 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
16 years 14 hour ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
EDM
2008
97views Data Mining» more  EDM 2008»
15 years 1 months ago
Using Item-type Performance Covariance to Improve the Skill Model of an Existing Tutor
Using data from an existing pre-algebra computer-based tutor, we analyzed the covariance of item-types with the goal of describing a more effective way to assign skill labels to it...
Philip I. Pavlik, Hao Cen, Lili Wu, Kenneth R. Koe...
BMCBI
2008
78views more  BMCBI 2008»
14 years 12 months ago
Evaluation of time profile reconstruction from complex two-color microarray designs
Background: As an alternative to the frequently used "reference design" for two-channel microarrays, other designs have been proposed. These designs have been shown to b...
Ana C. Fierro, Raphael Thuret, Kristof Engelen, Gi...
TOG
2002
107views more  TOG 2002»
14 years 11 months ago
Ordered and quantum treemaps: Making effective use of 2D space to display hierarchies
Treemaps, a space-filling method of visualizing large hierarchical data sets, are receiving increasing attention. Several algorithms have been proposed to create more useful displ...
Benjamin B. Bederson, Ben Shneiderman, Martin Watt...
IEEESCC
2007
IEEE
15 years 6 months ago
Web Services Security and Privacy
eb services are becoming widely deployed to implement the automation of business processes such as supply chain management, inventory tracking, and healthcare management, just to ...
Patrick C. K. Hung, Casey K. Fung