Sciweavers

4926 search results - page 779 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
FGR
2011
IEEE
176views Biometrics» more  FGR 2011»
14 years 10 months ago
Prop-free pointing detection in dynamic cluttered environments
Abstract—Vision-based prop-free pointing detection is challenging both from an algorithmic and a systems standpoint. From a computer vision perspective, accurately determining wh...
Pyry Matikainen, Padmanabhan Pillai, Lily B. Mumme...
COMPUTE
2010
ACM
15 years 10 months ago
Mining periodic-frequent patterns with maximum items' support constraints
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
R. Uday Kiran, P. Krishna Reddy
VLSID
2002
IEEE
98views VLSI» more  VLSID 2002»
16 years 6 months ago
On Test Scheduling for Core-Based SOCs
We present a mathematical model for the problem of scheduling tests for core-based system-on-chip (SOC) VLSI designs. Given a set of tests for each core in the SOC and a set of te...
Sandeep Koranne
DCOSS
2007
Springer
16 years 17 days ago
A Connectivity Based Partition Approach for Node Scheduling in Sensor Networks
This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensor...
Yong Ding, Chen Wang, Li Xiao
SACRYPT
2007
Springer
126views Cryptology» more  SACRYPT 2007»
16 years 15 days ago
Improved Side-Channel Collision Attacks on AES
Abstract. Side-channel collision attacks were proposed in [1] and applied to AES in [2]. These are based on detecting collisions in certain positions of the internal state after th...
Andrey Bogdanov