Sciweavers

3937 search results - page 505 / 788
» Questioning Ubiquitous Computing
Sort
View
JALC
2008
72views more  JALC 2008»
15 years 6 months ago
Maximal Error-Detecting Capabilities of Formal Languages
A combinatorial channel is a set of pairs of words describing all the possible input-output channel situations. We introduce the concept "maximal error-detecting capability&q...
Stavros Konstantinidis, Pedro V. Silva
JGAA
2008
97views more  JGAA 2008»
15 years 6 months ago
Drawing Bipartite Graphs on Two Parallel Convex Curves
Let G be a bipartite graph, and let e, i be two parallel convex curves; we study the question about whether G admits a planar straight-line drawing such that the vertices of one p...
Emilio Di Giacomo, Luca Grilli, Giuseppe Liotta
JQL
2008
97views more  JQL 2008»
15 years 6 months ago
Dependency-length minimization in natural and artificial languages
A wide range of evidence points to a preference for syntactic structures in which dependencies are short. Here we examine the question: what kinds of dependency configurations min...
David Temperley
DEDS
2007
109views more  DEDS 2007»
15 years 6 months ago
Concurrent Secrets
— Given a finite state system with partial observers and for each observer, a regular set of trajectories which we call a secret, we consider the question whether the observers ...
Eric Badouel, Marek A. Bednarczyk, Andrzej M. Borz...
MST
2006
97views more  MST 2006»
15 years 6 months ago
Optimal Implicit Dictionaries over Unbounded Universes
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
Gianni Franceschini, Roberto Grossi