Sciweavers

1063 search results - page 61 / 213
» Order and Negation as Failure
Sort
View
IUI
2000
ACM
14 years 2 months ago
Learning to recommend from positive evidence
In recent years, many systems and approaches for recommending information, products or other objects have been developed. In these systems, often machine learning methods that nee...
Ingo Schwab, Wolfgang Pohl, Ivan Koychev
ASPDAC
2007
ACM
77views Hardware» more  ASPDAC 2007»
14 years 1 months ago
Hippocrates: First-Do-No-Harm Detailed Placement
Physical synthesis optimizations and engineering change orders typically change the locations of cells, resize cells or add more cells to the design after global placement. Unfort...
Haoxing Ren, David Z. Pan, Charles J. Alpert, Gi-J...
KAIS
2008
114views more  KAIS 2008»
13 years 10 months ago
A new concise representation of frequent itemsets using generators and a positive border
A complete set of frequent itemsets can get undesirably large due to redundancy when the minimum support threshold is low or when the database is dense. Several concise representat...
Guimei Liu, Jinyan Li, Limsoon Wong
JHSN
2007
78views more  JHSN 2007»
13 years 9 months ago
Understanding of human behaviors from videos in nursing care monitoring systems
Abstract. This paper addresses the issue in scenario-based understanding of human behavior from videos in a nursing care monitoring system. The analysis is carried out based on exp...
Chin-De Liu, Pau-Choo Chung, Yi-Nung Chung, Moniqu...
ASPDAC
2009
ACM
115views Hardware» more  ASPDAC 2009»
14 years 4 months ago
Incremental and on-demand random walk for iterative power distribution network analysis
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
Yiyu Shi, Wei Yao, Jinjun Xiong, Lei He