Sciweavers

6562 search results - page 182 / 1313
» Noetherianity and Combination Problems
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
A new speaker identification algorithm for gaming scenarios
Speaker identification is a well-established research problem but has not been a major application used in gaming scenarios. In this paper, we propose a new algorithm for the ope...
Hoang Do, Ivan Tashev, Alex Acero
CVPR
2012
IEEE
13 years 9 months ago
See all by looking at a few: Sparse modeling for finding representative objects
We consider the problem of finding a few representatives for a dataset, i.e., a subset of data points that efficiently describes the entire dataset. We assume that each data poi...
Ehsan Elhamifar, Guillermo Sapiro, René Vid...
CONCUR
2012
Springer
13 years 8 months ago
Making Weighted Containment Feasible: A Heuristic Based on Simulation and Abstraction
Simulation and Abstraction Guy Avni and Orna Kupferman School of Computer Science and Engineering, Hebrew University, Israel Weighted automata map input words to real numbers and a...
Guy Avni, Orna Kupferman
TPHOL
2007
IEEE
16 years 22 days ago
Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL
We present a simple method to formally prove termination of recursive functions by searching for lexicographic combinations of size measures. Despite its simplicity, the method tur...
Lukas Bulwahn, Alexander Krauss, Tobias Nipkow
ICES
2003
Springer
124views Hardware» more  ICES 2003»
15 years 11 months ago
Evolving Multiplier Circuits by Training Set and Training Vector Partitioning
Evolvable Hardware (EHW) has been proposed as a new method for evolving circuits automatically. One of the problems appearing is that only circuits of limited size are evolvable. I...
Jim Torresen