9842 search results - page 1634 / 1969 » The Complexity of the Matching-Cut Problem |
198
click to vote
IROS
2006
IEEE
16 years 22 days ago
2006
IEEE
Abstract— We study the problem of registering local relative pose estimates to produce a global consistent trajectory of a moving robot. Traditionally, this problem has been stud...
141
click to vote
ISCAS
2006
IEEE
16 years 22 days ago
2006
IEEE
— Fast QR decomposition RLS (FQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The FQRD-RLS algorithms do not provide acce...
145
click to vote
SRDS
2006
IEEE
16 years 21 days ago
2006
IEEE
Celeste is a robust peer-to-peer object store built on top of a distributed hash table (DHT). Celeste is a working system, developed by Sun Microsystems Laboratories. During the d...
179
click to vote
WETICE
2006
IEEE
16 years 21 days ago
2006
IEEE
Debugging grid systems is complex, mainly because of the probe effect and non reproducible execution. The probe effect arises when an attempt to monitor a system changes the behav...
184
click to vote
ADBIS
2006
Springer
16 years 21 days ago
2006
Springer
In many information systems, the databases that make up the system are distributed in different modules or branch offices according to the requirements of the business enterprise. ...