Sciweavers

294 search results - page 51 / 59
» Optimized fixed-size kernel models for large data sets
Sort
View
ICDE
2005
IEEE
120views Database» more  ICDE 2005»
14 years 9 months ago
Progressive Distributed Top k Retrieval in Peer-to-Peer Networks
Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the dat...
Wolf-Tilo Balke, Wolfgang Nejdl, Wolf Siberski, Uw...
CIKM
2009
Springer
14 years 1 months ago
Heterogeneous cross domain ranking in latent space
Traditional ranking mainly focuses on one type of data source, and effective modeling still relies on a sufficiently large number of labeled or supervised examples. However, in m...
Bo Wang, Jie Tang, Wei Fan, Songcan Chen, Zi Yang,...
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 8 months ago
Efficient and effective explanation of change in hierarchical summaries
Dimension attributes in data warehouses are typically hierarchical (e.g., geographic locations in sales data, URLs in Web traffic logs). OLAP tools are used to summarize the measu...
Deepak Agarwal, Dhiman Barman, Dimitrios Gunopulos...
PODS
2002
ACM
168views Database» more  PODS 2002»
14 years 8 months ago
Conjunctive Selection Conditions in Main Memory
We consider the fundamental operation of applying a conjunction of selection conditions to a set of records. With large main memories available cheaply, systems may choose to keep...
Kenneth A. Ross
ISCA
1999
IEEE
110views Hardware» more  ISCA 1999»
14 years 22 days ago
Decoupling Local Variable Accesses in a Wide-Issue Superscalar Processor
Providing adequate data bandwidth is extremely important for a wide-issue superscalar processor to achieve its full performance potential. Adding a large number of ports to a data...
Sangyeun Cho, Pen-Chung Yew, Gyungho Lee