Sciweavers

2272 search results - page 270 / 455
» Capture Complexity by Partition
Sort
View
136
Voted
MICRO
2006
IEEE
94views Hardware» more  MICRO 2006»
15 years 3 months ago
A Sampling Method Focusing on Practicality
In the past few years, several research works have demonstrated that sampling can drastically speed up architecture simulation, and several of these sampling techniques are already...
Daniel Gracia Pérez, Hugues Berry, Olivier ...
114
Voted
TCAD
1998
86views more  TCAD 1998»
15 years 3 months ago
Fast heuristic and exact algorithms for two-level hazard-free logic minimization
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
Michael Theobald, Steven M. Nowick
162
Voted
PAMI
2010
274views more  PAMI 2010»
14 years 10 months ago
3D Face Recognition Using Isogeodesic Stripes
In this paper, we present a novel approach to 3D face matching that shows high effectiveness in distinguishing facial differences between distinct individuals from differences indu...
Stefano Berretti, Alberto Del Bimbo, Pietro Pala
169
Voted
SDM
2011
SIAM
256views Data Mining» more  SDM 2011»
14 years 6 months ago
Temporal Structure Learning for Clustering Massive Data Streams in Real-Time
This paper describes one of the first attempts to model the temporal structure of massive data streams in real-time using data stream clustering. Recently, many data stream clust...
Michael Hahsler, Margaret H. Dunham
148
Voted
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
15 years 7 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio