Sciweavers

2229 search results - page 415 / 446
» Comparative analysis of biclustering algorithms
Sort
View
DIALM
2007
ACM
131views Algorithms» more  DIALM 2007»
13 years 11 months ago
Dessy: Towards Flexible Mobile Desktop Search
In the near future, mobile devices are expected to have a storage capacity comparable to today's desktop machines. As the amount of infomation grows, conventional search tool...
Eemil Lagerspetz, Tancred Lindholm, Sasu Tarkoma
BROADNETS
2006
IEEE
13 years 11 months ago
Wavelength Assignment in Optical Networks with Imprecise Network State Information
Efficient routing and wavelength assignment (RWA) in wavelength-routed all-optical networks is critical for achieving high efficiency over the backbone links. Extensive research ha...
Satyajeet Ahuja, Marwan Krunz, Srinivasan Ramasubr...
SIGGRAPH
1995
ACM
13 years 11 months ago
Fast multiresolution image querying
We present a method for searching in an image database using a query image that is similar to the intended target. The query image may be a hand-drawn sketch or a (potentially low...
Charles E. Jacobs, Adam Finkelstein, David Salesin
CIKM
2008
Springer
13 years 9 months ago
Scalable community discovery on textual data with relations
Every piece of textual data is generated as a method to convey its authors' opinion regarding specific topics. Authors deliberately organize their writings and create links, ...
Huajing Li, Zaiqing Nie, Wang-Chien Lee, C. Lee Gi...
BCBGC
2008
13 years 9 months ago
BMA - Boolean Matrices as Model for Motif Kernels
We introduce the data model BM, which specifies kernels of motifs by means of Boolean matrices. Different from position frequency matrices these only specify which bases can appea...
Jan Schröder, Manfred Schimmler, Heiko Schr&o...