Sciweavers

1670 search results - page 95 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
SAC
1995
ACM
15 years 9 months ago
Design of a VLSI very high speed reconfigurable digital fuzzy processor
A trigger system in High Energy Physics Experiments (HEPE) has to decide, in few µs, if the data related to a nuclear event have to be stored or not. Normally, these data, are co...
Enzo Gandolfi, Alessandro Gabrielli, Massimo Maset...
APPROX
2006
Springer
107views Algorithms» more  APPROX 2006»
15 years 10 months ago
A Fast Random Sampling Algorithm for Sparsifying Matrices
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
Sanjeev Arora, Elad Hazan, Satyen Kale
TMI
2002
147views more  TMI 2002»
15 years 5 months ago
Cortex Segmentation - A Fast Variational Geometric Approach
An automatic cortical gray matter segmentation from a three-dimensional (3-D) brain images [magnetic resonance (MR) or computed tomography] is a well known problem in medical image...
Roman Goldenberg, Ron Kimmel, Ehud Rivlin, Michael...
FCCM
2004
IEEE
130views VLSI» more  FCCM 2004»
15 years 10 months ago
Hyperreconfigurable Architectures for Fast Run Time Reconfiguration
Dynamically reconfigurable architectures or systems are able to reconfigure their function and/or structure to suit changing needs of a computation during run time. The increasing...
Sebastian Lange, Martin Middendorf
TPHOL
2000
IEEE
15 years 10 months ago
Fast Tactic-Based Theorem Proving
Theorem provers for higher-order logics often use tactics to implement automated proof search. Tactics use a general-purpose metalanguage to implement both general-purpose reasonin...
Jason Hickey, Aleksey Nogin