12289 search results - page 600 / 2458 » computing 2006 |
199
click to vote
JGAA
2006
15 years 7 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
168
click to vote
PAMI
2010
15 years 5 months ago
2010
—Representing 2D and 3D data sets with implicit polynomials (IPs) has been attractive because of its applicability to various computer vision issues. Therefore, many IP fitting m...
186
click to vote
JSAC
2010
15 years 5 months ago
2010
—Joint synchronization and localization using time of arrival (TOA) measurements is a very important research topic for many wireless ad hoc sensor network applications. For such...
164
click to vote
JSYML
2002
15 years 6 months ago
2002
A computably enumerable (c.e.) degree is a maximal contiguous degree if it is contiguous and no c.e. degree strictly above it is contiguous. We show that there are infinitely many ...
179
click to vote
FUIN
2006
15 years 7 months ago
2006
This work is a continuation of the investigations aiming to bridge membrane computing (where in a compartmental cell-like structure the chemicals to evolve are placed in the compar...