Sciweavers

1017 search results - page 20 / 204
» Some existence and construction results of polygonal designs
Sort
View
SIGMOD
2006
ACM
131views Database» more  SIGMOD 2006»
14 years 7 months ago
An automatic construction and organization strategy for ensemble learning on data streams
As data streams are gaining prominence in a growing number of emerging application domains, classification on data streams is becoming an active research area. Currently, the typi...
Yi Zhang, Xiaoming Jin
ISPD
2012
ACM
288views Hardware» more  ISPD 2012»
12 years 2 months ago
Construction of realistic gate sizing benchmarks with known optimal solutions
Gate sizing in VLSI design is a widely-used method for power or area recovery subject to timing constraints. Several previous works have proposed gate sizing heuristics for power ...
Andrew B. Kahng, Seokhyeong Kang
IJMMS
2006
74views more  IJMMS 2006»
13 years 7 months ago
Constructing computer-based tutors that are socially sensitive: Politeness in educational software
Students rated 16 tutorial statements on negative politeness (i.e., how much the tutor ``allows me freedom to make my own decisions'') and positive politeness (i.e., how...
Richard E. Mayer, W. Lewis Johnson, Erin Shaw, Sah...
ICDE
1991
IEEE
145views Database» more  ICDE 1991»
13 years 11 months ago
DOT: A Spatial Access Method Using Fractals
Existing Database Management Systems (DBMSs) do not handle efficiently multi-dimensional data such as boxes, polygons, or even points in a multi-dimensional space. We examine acc...
Christos Faloutsos, Yi Rong
COMBINATORICS
1998
99views more  COMBINATORICS 1998»
13 years 7 months ago
Constructions for Cubic Graphs with Large Girth
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer µ0(g), the smallest number of v...
Norman Biggs