Sciweavers

1225 search results - page 81 / 245
» Maximal Consistent Subsets
Sort
View
IMR
2004
Springer
14 years 1 months ago
Parallel Mesh Refinement Without Communication
This paper presents a technique for the adaptive refinement of tetrahedral meshes. What makes it unique is that no neighbor information is required for the refined mesh to be co...
Philippe P. Pébay, David C. Thompson
ICEIS
2003
IEEE
14 years 1 months ago
Incremental Horizontal Fragmentation of Database Class Objects
: Horizontal fragments of a class in an object-oriented database system contain subsets of the class extent or instance objects. These fragments are created with a set of system in...
Christie I. Ezeife, Pinakpani Dey
CP
2003
Springer
14 years 1 months ago
Using Constraint Programming to Solve the Maximum Clique Problem
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
Jean-Charles Régin
FCT
2003
Springer
14 years 1 months ago
Operations Preserving Recognizable Languages
Abstract. Given a subset S of N, filtering a word a0a1 · · · an by S consists in deleting the letters ai such that i is not in S. By a natural generalization, denote by L[S], w...
Jean Berstel, Luc Boasson, Olivier Carton, Bruno P...
FSR
2003
Springer
112views Robotics» more  FSR 2003»
14 years 1 months ago
Decentralised SLAM with Low-Bandwidth Communication for Teams of Vehicles
— This paper addresses the problem of simultaneous localization and mapping (SLAM) for teams of collaborating vehicles where the communication bandwidth is limited. We present a ...
Eric Nettleton, Sebastian Thrun, Hugh F. Durrant-W...