Sciweavers

5889 search results - page 1017 / 1178
» Graph Layout Problems
Sort
View
IJNM
2000
91views more  IJNM 2000»
15 years 2 months ago
Coding-based schemes for fault identification in communication networks
The complexity of communication networks and the amount of information transferred in these networks have made the management of such networks increasingly difficult. Since faults ...
Chi-Chun Lo, Shing Hong Chen, Bon-Yeh Lin
ALGORITHMICA
1998
118views more  ALGORITHMICA 1998»
15 years 2 months ago
On the Analysis of Linear Probing Hashing
Abstract. This paper presents moment analyses and characterizations of limit distributions for the construction cost of hash tables under the linear probing strategy. Two models ar...
Philippe Flajolet, Patricio V. Poblete, Alfredo Vi...
AI
1999
Springer
15 years 2 months ago
Bucket Elimination: A Unifying Framework for Reasoning
Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolut...
Rina Dechter
TIP
1998
114views more  TIP 1998»
15 years 2 months ago
An optimal polygonal boundary encoding scheme in the rate distortion sense
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
Guido M. Schuster, Aggelos K. Katsaggelos
PVLDB
2008
121views more  PVLDB 2008»
15 years 1 months ago
Type inference and type checking for queries on execution traces
This paper studies, for the first time, the management of type information for an important class of semi-structured data: nested DAGs (Directed Acyclic Graphs) that describe exec...
Daniel Deutch, Tova Milo
« Prev « First page 1017 / 1178 Last » Next »