Sciweavers

1566 search results - page 87 / 314
» Saving Space in a Time Efficient Simulation Algorithm
Sort
View
FOCS
2007
IEEE
14 years 2 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
NIPS
2008
13 years 9 months ago
Exploring Large Feature Spaces with Hierarchical Multiple Kernel Learning
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...
Francis Bach
DAC
1994
ACM
14 years 10 days ago
Dynamic Search-Space Pruning Techniques in Path Sensitization
A powerful combinational path sensitization engine is required for the efficient implementation of tools for test pattern generation, timing analysis, and delay fault testing. Path...
João P. Marques Silva, Karem A. Sakallah

Publication
209views
13 years 5 months ago
Adaptive beamforming method based on constrained LMS algorithm for tracking mobile user
In this paper, Constrained Least Mean Square (CLMS) algorithm for narrowband adaptive beamforming for tracking mobile user in a 2D urban environment has been used. This algorithm i...
Peyman Rahmati
COMCOM
2004
96views more  COMCOM 2004»
13 years 8 months ago
Achieving proportional delay differentiation efficiently
In this paper, we focus on efficiently achieving Proportional Delay Differentiation (PDD), an instance of the Proportional Differentiation Model (PDM) first proposed under the Dif...
Hoon-Tong Ngin, Chen-Khong Tham