Sciweavers

820 search results - page 157 / 164
» Finding low-utility data structures
Sort
View
EDBT
2008
ACM
166views Database» more  EDBT 2008»
14 years 8 months ago
OrthoCluster: a new tool for mining synteny blocks and applications in comparative genomics
By comparing genomes among both closely and distally related species, comparative genomics analysis characterizes structures and functions of different genomes in both conserved a...
Xinghuo Zeng, Matthew J. Nesbitt, Jian Pei, Ke Wan...
ICFP
2005
ACM
14 years 8 months ago
Type inference, principal typings, and let-polymorphism for first-class mixin modules
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
Henning Makholm, J. B. Wells
SODA
2010
ACM
704views Algorithms» more  SODA 2010»
14 years 6 months ago
A locality-sensitive hash for real vectors
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
Tyler Neylon
IPOM
2007
Springer
14 years 2 months ago
Measurement and Analysis of Intraflow Performance Characteristics of Wireless Traffic
It is by now widely accepted that the arrival process of aggregate network traffic exhibits self-similar characteristics which result in the preservation of traffic burstiness (hig...
Dimitrios P. Pezaros, Manolis Sifalakis, David Hut...
CSCW
2006
ACM
14 years 2 months ago
Improving network efficiency in real-time groupware with general message compression
Groupware communicates by sending messages across the network, and groupware programmers use a variety of formats for these messages, such as XML, plain text, or serialized object...
Carl Gutwin, Christopher Fedak, Mark Watson, Jeff ...