Sciweavers

379 search results - page 49 / 76
» Generalized Typestate Checking for Data Structure Consistenc...
Sort
View
WADS
2007
Springer
128views Algorithms» more  WADS 2007»
14 years 1 months ago
Approximate Range Searching: The Absolute Model
Range searching is a well known problem in the area of geometric data structures. We consider this problem in the context of approximation, where an approximation parameter ε >...
Guilherme Dias da Fonseca
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 7 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
ERLANG
2003
ACM
14 years 1 months ago
A study of Erlang ETS table implementations and performance
The viability of implementing an in-memory database, Erlang ETS, using a relatively-new data structure, called a Judy array, was studied by comparing the performance of ETS tables...
Scott Lystig Fritchie
GECCO
2007
Springer
167views Optimization» more  GECCO 2007»
14 years 1 months ago
Eye-tracking evolutionary algorithm to minimize user fatigue in IEC applied to interactive one-max problem
In this paper, we describe a new algorithm that consists in combining an eye-tracker for minimizing the fatigue of a user during the evaluation process of Interactive Evolutionary...
Denis Pallez, Philippe Collard, Thierry Baccino, L...
NGC
2002
Springer
103views Communications» more  NGC 2002»
13 years 7 months ago
An Evaluation of Topology-sensitive Subgroup Communication Mechanism in Large-scale Multicast Applications
Abundant content, data type and diverse members' interests naturally lead to preference heterogeneity within a multicast session requiring frequent communication within subgr...
Jangwon Lee, Gustavo de Veciana