Sciweavers

7930 search results - page 91 / 1586
» Greedy in Approximation Algorithms
Sort
View
LREC
2008
133views Education» more  LREC 2008»
15 years 7 months ago
Comparing Set-Covering Strategies for Optimal Corpus Design
This article is interested in the problem of the linguistic content of a speech corpus. Depending on the target task, the phonological and linguistic content of the corpus is cont...
Jonathan Chevelu, Nelly Barbot, Olivier Boëff...
CBMS
2005
IEEE
15 years 8 months ago
Biclustering of Expression Data Using Simulated Annealing
In gene expression data a bicluster is a subset of genes and a subset of conditions which show correlating levels of expression. However, the problem of finding significant biclu...
Kenneth Bryan, Padraig Cunningham, Nadia Bolshakov...
INFOCOM
2008
IEEE
16 years 18 days ago
Real-Time Video Multicast in WiMAX Networks
Abstract—IEEE 802.16e WiMAX is a promising new technology for broadband access networks. Amongst the class of applications that can be supported is real time video services (such...
Supratim Deb, Sharad Jaiswal, Kanthi Nagaraj
INFORMATICALT
2000
113views more  INFORMATICALT 2000»
15 years 6 months ago
An Intensive Search Algorithm for the Quadratic Assignment Problem
Many heuristics, such as simulated annealing, genetic algorithms, greedy randomized adaptive search procedures are stochastic. In this paper, we propose a deterministic heuristic a...
Alfonsas Misevicius

Book
2455views
17 years 4 months ago
Art of Programming Contest - C Programming Tutorials | Data Structures | Algorithms
"The objective of this edition is not only to assist the contestants during the contest hours but also describing the core subjects of Computer Science such as C Programming, ...
Ahmed Shamsul Arefin