Sciweavers

753 search results - page 83 / 151
» Completing a (k - 1)-Assignment
Sort
View
EDBT
2004
ACM
142views Database» more  EDBT 2004»
15 years 10 months ago
Iterative Incremental Clustering of Time Series
We present a novel anytime version of partitional clustering algorithm, such as k-Means and EM, for time series. The algorithm works by leveraging off the multi-resolution property...
Jessica Lin, Michail Vlachos, Eamonn J. Keogh, Dim...
ICCAD
2007
IEEE
87views Hardware» more  ICCAD 2007»
15 years 6 months ago
Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design
—Register allocation, in high-level synthesis and ASIP design, is the process of determining the number of registers to include in the resulting circuit or processor. The goal is...
Philip Brisk, Ajay K. Verma, Paolo Ienne
ICCAD
2007
IEEE
101views Hardware» more  ICCAD 2007»
15 years 6 months ago
Analog placement with common centroid constraints
— In order to reduce parasitic mismatch in analog circuits, some groups of devices are required to share a common centroid while being placed. Devices are split into smaller ones...
Qiang Ma, Evangeline F. Y. Young, K. P. Pun
SIGCSE
2010
ACM
169views Education» more  SIGCSE 2010»
15 years 4 months ago
Interfaces first (and foremost) with Java
ion is a critical concept that underlies many topics in computing science. For example, in software engineering, the distinction between a component’s behavior and its implement...
Paolo A. G. Sivilotti, Matthew Lang
TEI
2010
ACM
257views Hardware» more  TEI 2010»
15 years 4 months ago
Traditional games meet ICT: a case study on go game augmentation
While pervasive technologies explore new gaming styles, traditional games, such as cards and tabletop games are still appealing and have various irreplaceable flavors. We point ou...
Takahiro Iwata, Tetsuo Yamabe, Mikko Polojärv...