Sciweavers

1094 search results - page 21 / 219
» One Size Fits All
Sort
View
PODS
2003
ACM
113views Database» more  PODS 2003»
14 years 10 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
PR
2006
80views more  PR 2006»
13 years 10 months ago
Neighborhood size selection in the k-nearest-neighbor rule using statistical confidence
The k-nearest-neighbor rule is one of the most attractive pattern classification algorithms. In practice, the choice of k is determined by the cross-validation method. In this wor...
Jigang Wang, Predrag Neskovic, Leon N. Cooper
ICDM
2007
IEEE
129views Data Mining» more  ICDM 2007»
14 years 4 months ago
Disk Aware Discord Discovery: Finding Unusual Time Series in Terabyte Sized Datasets
The problem of finding unusual time series has recently attracted much attention, and several promising methods are now in the literature. However, virtually all proposed methods...
Dragomir Yankov, Eamonn J. Keogh, Umaa Rebbapragad...
WG
2004
Springer
14 years 3 months ago
Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
Takehiro Ito, Xiao Zhou, Takao Nishizeki
CASES
2003
ACM
14 years 3 months ago
Reducing code size with echo instructions
In an embedded system, the cost of storing a program onchip can be as high as the cost of a microprocessor. Compressing an application’s code to reduce the amount of memory requ...
Jeremy Lau, Stefan Schoenmackers, Timothy Sherwood...