Sciweavers

1071 search results - page 162 / 215
» Theories of Automatic Structures and Their Complexity
Sort
View
PODS
2000
ACM
146views Database» more  PODS 2000»
14 years 14 days ago
Analysis and Application of Adaptive Sampling
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
James F. Lynch
WSC
2008
13 years 10 months ago
Modeling and simulation of e-mail social networks: A new stochastic agent-based approach
Understanding how the structure of a network evolves over time is one of the most interesting and complex topics in the field of social networks. In our attempt to model the dynam...
Fabian Menges, Bud Mishra, Giuseppe Narzisi
EICS
2010
ACM
13 years 10 months ago
Xplain: an editor for building self-explanatory user interfaces by model-driven engineering
Modern User Interfaces (UI) must deal with the increasing complexity of applications in terms of functionality as well as new properties as plasticity. The plasticity of a UI deno...
Alfonso García Frey, Gaëlle Calvary, S...
CORR
2004
Springer
119views Education» more  CORR 2004»
13 years 8 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
14 years 1 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen