Sciweavers

3466 search results - page 57 / 694
» Fast computation of special resultants
Sort
View
IVA
2009
Springer
14 years 5 months ago
Teaching Computers to Conduct Spoken Interviews: Breaking the Realtime Barrier with Learning
Abstract. Several challenges remain in the effort to build software capable of conducting realtime dialogue with people. Part of the problem has been a lack of realtime flexibili...
Gudny Ragna Jonsdottir, Kristinn R. Thóriss...
IJHPCA
2006
99views more  IJHPCA 2006»
13 years 11 months ago
A Pragmatic Analysis Of Scheduling Environments On New Computing Platforms
Today, large scale parallel systems are available at relatively low cost. Many powerful such systems have been installed all over the world and the number of users is always incre...
Lionel Eyraud
ICIP
2007
IEEE
15 years 25 days ago
An Efficient Method for Compressed Sensing
Compressed sensing or compressive sampling (CS) has been receiving a lot of interest as a promising method for signal recovery and sampling. CS problems can be cast as convex prob...
Seung-Jean Kim, Kwangmoo Koh, Michael Lustig, Step...
EOR
2008
107views more  EOR 2008»
13 years 11 months ago
Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
Alysson M. Costa, Jean-François Cordeau, Gi...
DAC
2000
ACM
15 years 3 days ago
Fast methods for extraction and sparsification of substrate coupling
The sudden increase in systems-on-a-chip designs has renewed interest in techniques for analyzing and eliminating substrate coupling problems. Previous work on the substrate coupl...
Joe Kanapka, Joel R. Phillips, Jacob White