Sciweavers

1419 search results - page 97 / 284
» A Characterization of Constructive Dimension
Sort
View
IJCM
2010
80views more  IJCM 2010»
15 years 2 months ago
On implementing recognizable transductions
Recognizable transductions constitute a proper subclass of rational transductions, characterized by the well-known Mezei’s Theorem. We propose a family of transducers which refl...
Stavros Konstantinidis, Nicolae Santean, S. Yu
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
15 years 10 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
MOBIHOC
2008
ACM
16 years 4 months ago
Complexity in wireless scheduling: impact and tradeoffs
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
Yung Yi, Alexandre Proutiere, Mung Chiang
ICDE
2011
IEEE
240views Database» more  ICDE 2011»
14 years 8 months ago
Similarity measures for multidimensional data
— How similar are two data-cubes? In other words, the question under consideration is: given two sets of points in a multidimensional hierarchical space, what is the distance val...
Eftychia Baikousi, Georgios Rogkakos, Panos Vassil...
STACS
2010
Springer
15 years 11 months ago
Relaxed Spanners for Directed Disk Graphs
Let (V, δ) be a finite metric space, where V is a set of n points and δ is a distance function defined for these points. Assume that (V, δ) has a constant doubling dimension d...
David Peleg, Liam Roditty