Sciweavers

705 search results - page 113 / 141
» Approximating Extended Answer Sets
Sort
View
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
15 years 3 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
APPROX
2004
Springer
136views Algorithms» more  APPROX 2004»
15 years 3 months ago
On the Crossing Spanning Tree Problem
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit...
CCGRID
2002
IEEE
15 years 2 months ago
NEVRLATE: Scalable Resource Discovery
A scalable and expressive peer-to-peer (P2P) networking and computing framework requires efficient resource discovery services. Here we propose NEVRLATE, for Network-Efficient V...
Ajay Chander, Steven Dawson, Patrick Lincoln, Davi...
FMCAD
2004
Springer
15 years 1 months ago
Verification of Analog and Mixed-Signal Circuits Using Hybrid System Techniques
In this paper we demonstrate a potential extension of formal verification methodology in order to deal with time-domain properties of analog and mixed-signal circuits whose dynamic...
Thao Dang, Alexandre Donzé, Oded Maler
80
Voted
ESA
2006
Springer
111views Algorithms» more  ESA 2006»
15 years 1 months ago
Path Hitting in Acyclic Graphs
An instance of the path hitting problem consists of two families of paths, D and H, in a common undirected graph, where each path in H is associated with a non-negative cost. We r...
Ojas Parekh, Danny Segev