Sciweavers

2489 search results - page 184 / 498
» On the Subgroup Distance Problem
Sort
View
JUCS
2007
99views more  JUCS 2007»
15 years 4 months ago
Consensus Determining with Dependencies of Attributes with Interval Values
: In this paper the author considers some problems related to attribute dependencies in consensus determining. These problems concern the dependencies of attributes representing th...
Michal Zgrzywa
JC
2000
78views more  JC 2000»
15 years 4 months ago
Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation
Deciding efficiently the emptiness of a real algebraic set defined by a single equation is a fundamental problem of computational real algebraic geometry. We propose an algorithm ...
Fabrice Rouillier, Marie-Françoise Roy, Moh...
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
16 years 4 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...
DCOSS
2009
Springer
15 years 11 months ago
Fast Self-stabilization for Gradients
Abstract. Gradients are distributed distance estimates used as a building block in many sensor network applications. In large or long-lived deployments, it is important for the est...
Jacob Beal, Jonathan Bachrach, Daniel Vickery, Mar...
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