Sciweavers

8294 search results - page 1135 / 1659
» Presenting Data from Experiments in Algorithmics
Sort
View
173
Voted
BMCBI
2006
144views more  BMCBI 2006»
15 years 6 months ago
More robust detection of motifs in coexpressed genes by using phylogenetic information
Background: Several motif detection algorithms have been developed to discover overrepresented motifs in sets of coexpressed genes. However, in a noisy gene list, the number of ge...
Pieter Monsieurs, Gert Thijs, Abeer A. Fadda, Sigr...
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
16 years 8 months ago
Keyword Search on Spatial Databases
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
Ian De Felipe, Vagelis Hristidis, Naphtali Rishe
ICML
2006
IEEE
16 years 7 months ago
Deterministic annealing for semi-supervised kernel machines
An intuitive approach to utilizing unlabeled data in kernel-based classification algorithms is to simply treat unknown labels as additional optimization variables. For marginbased...
Vikas Sindhwani, S. Sathiya Keerthi, Olivier Chape...
181
Voted
IEEECGIV
2009
IEEE
16 years 1 months ago
GPU Supported Patch-Based Tessellation for Dual Subdivision
A novel patch-based tessellation method for a dual subdivision scheme, the Doo-Sabin subdivision, is presented. Patch-based refinement for face-split subdivision schemes such as ...
Fengtao Fan, Fuhua (Frank) Cheng
WSOM
2009
Springer
16 years 1 months ago
Approaching the Time Dependent Cocktail Party Problem with Online Sparse Coding Neural Gas
Abstract. We show how the “Online Sparse Coding Neural Gas” algorithm can be applied to a more realistic model of the “Cocktail Party Problem”. We consider a setting where ...
Kai Labusch, Erhardt Barth, Thomas Martinetz
« Prev « First page 1135 / 1659 Last » Next »