Sciweavers

4037 search results - page 7 / 808
» Routing without ordering
Sort
View
EMMCVPR
2009
Springer
13 years 5 months ago
Intrinsic Second-Order Geometric Optimization for Robust Point Set Registration without Correspondence
Determining Euclidean transformations for the robust registration of noisy unstructured point sets is a key problem of model-based computer vision and numerous industrial applicati...
Dirk Breitenreicher, Christoph Schnörr
DCC
2008
IEEE
14 years 7 months ago
Sequences in abelian groups G of odd order without zero-sum subsequences of length exp ( G )
We present a new construction for sequences in the finite abelian group Cr n without zero-sum subsequences of length n, for odd n. This construction improves the maximal known car...
Yves Edel
ICDE
2003
IEEE
120views Database» more  ICDE 2003»
14 years 9 months ago
Broadcasting Dependent Data for Ordered Queries without Replication in a Multi-Channel Mobile Environment
In several mobile applications, the data items broadcast are dependent upon one another. However, most prior studies on broadcasting dependent data mainly consider single broadcas...
Jiun-Long Huang, Ming-Syan Chen, Wen-Chih Peng
RP
2009
Springer
124views Control Systems» more  RP 2009»
14 years 2 months ago
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...
Denis Lugiez