Sciweavers

2034 search results - page 277 / 407
» On the Comparability of Software Clustering Algorithms
Sort
View
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
11 years 10 months ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha
SIGMETRICS
2011
ACM
182views Hardware» more  SIGMETRICS 2011»
12 years 11 months ago
Fine-grained latency and loss measurements in the presence of reordering
Modern trading and cluster applications require microsecond latencies and almost no losses in data centers. This paper introduces an algorithm called FineComb that can estimate ...
Myungjin Lee, Sharon Goldberg, Ramana Rao Kompella...
GECCO
2004
Springer
14 years 1 months ago
Metaheuristics for Natural Language Tagging
Abstract. This work compares different metaheuristics techniques applied to an important problem in natural language: tagging. Tagging amounts to assigning to each word in a text ...
Lourdes Araujo, Gabriel Luque, Enrique Alba
VIS
2007
IEEE
149views Visualization» more  VIS 2007»
14 years 9 months ago
Time Dependent Processing in a Parallel Pipeline Architecture
Pipeline architectures provide a versatile and efficient mechanism for constructing visualizations, and they have been implemented in numerous libraries and applications over the p...
John Biddiscombe, Berk Geveci, Ken Martin, Kenn...
BMCBI
2005
137views more  BMCBI 2005»
13 years 8 months ago
ArrayQuest: a web resource for the analysis of DNA microarray data
Background: Numerous microarray analysis programs have been created through the efforts of Open Source software development projects. Providing browser-based interfaces that allow...
Gary L. Argraves, Saurin D. Jani, Jeremy L. Barth,...