Sciweavers

5981 search results - page 310 / 1197
» time 2006
Sort
View
ASPDAC
2006
ACM
110views Hardware» more  ASPDAC 2006»
16 years 18 days ago
Switching-activity driven gate sizing and Vth assignment for low power design
Power consumption has gained much saliency in circuit design recently. One design problem is modelled as ”Under a timing constraint, to minimize power as much as possible”. Pr...
Yu-Hui Huang, Po-Yuan Chen, TingTing Hwang
CIAC
2006
Springer
278views Algorithms» more  CIAC 2006»
15 years 10 months ago
Covering a Set of Points with a Minimum Number of Lines
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
Magdalene Grantson, Christos Levcopoulos
ACL
2006
15 years 8 months ago
A Fast, Accurate Deterministic Parser for Chinese
We present a novel classifier-based deterministic parser for Chinese constituency parsing. Our parser computes parse trees from bottom up in one pass, and uses classifiers to make...
Mengqiu Wang, Kenji Sagae, Teruko Mitamura
ACMACE
2006
ACM
16 years 18 days ago
Age invaders
—This paper introduces Age Invaders (AI), a novel interactive inter-generation social-physical game which allows the elderly to play harmoniously together with children in physic...
Khoo Eng Tat, Shang Ping Lee, Adrian David Cheok
CIAC
2006
Springer
79views Algorithms» more  CIAC 2006»
15 years 10 months ago
Matching Subsequences in Trees
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...
Philip Bille, Inge Li Gørtz