Sciweavers

474 search results - page 87 / 95
» On Multicast Path Finding Algorithms
Sort
View
FIMI
2003
95views Data Mining» more  FIMI 2003»
13 years 9 months ago
Probabilistic Iterative Expansion of Candidates in Mining Frequent Itemsets
A simple new algorithm is suggested for frequent itemset mining, using item probabilities as the basis for generating candidates. The method first finds all the frequent items, an...
Attila Gyenesei, Jukka Teuhola
CHES
2010
Springer
210views Cryptology» more  CHES 2010»
13 years 8 months ago
Flash Memory 'Bumping' Attacks
This paper introduces a new class of optical fault injection attacks called bumping attacks. These attacks are aimed at data extraction from secure embedded memory, which usually s...
Sergei Skorobogatov
DAM
2010
167views more  DAM 2010»
13 years 7 months ago
A new characterization of P6-free graphs
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
Pim van 't Hof, Daniël Paulusma
ENGL
2008
81views more  ENGL 2008»
13 years 7 months ago
GA-based Optimization of Sigma-delta Modulators for Wireless Transceivers
Abstract--Over-sampling sigma-delta analog-todigital converters (ADCs) are one of the key building blocks of state of the art wireless transceivers. In sigma-delta modulator design...
Babita R. Jose, P. Mythili, Jimson Mathew
JAIR
2008
98views more  JAIR 2008»
13 years 7 months ago
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes cor...
Menkes Hector Louis van den Briel, Thomas Vossen, ...