Sciweavers

2612 search results - page 454 / 523
» Switching Graphs and Their Complexity
Sort
View
GD
2005
Springer
14 years 3 months ago
Fast Node Overlap Removal
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
Tim Dwyer, Kim Marriott, Peter J. Stuckey
MOBICOM
2004
ACM
14 years 3 months ago
Initializing newly deployed ad hoc and sensor networks
A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems exis...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
AMAI
2004
Springer
14 years 3 months ago
New Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and...
Kalev Kask, Rina Dechter, Vibhav Gogate
CSL
2004
Springer
14 years 3 months ago
Moving in a Crumbling Network: The Balanced Case
In this paper we continue the study of ‘sabotage modal logic’ SML which was suggested by van Benthem. In this logic one describes the progression along edges of a transition gr...
Philipp Rohde
DEXA
2004
Springer
136views Database» more  DEXA 2004»
14 years 3 months ago
PC-Filter: A Robust Filtering Technique for Duplicate Record Detection in Large Databases
: In this paper, we will propose PC-Filter (PC stands for Partition Comparison), a robust data filter for approximately duplicate record detection in large databases. PC-Filter dis...
Ji Zhang, Tok Wang Ling, Robert M. Bruckner, Han L...