Sciweavers

4791 search results - page 725 / 959
» Clustering with partial information
Sort
View
TPDS
1998
73views more  TPDS 1998»
15 years 6 months ago
A Fully Adaptive Routing Algorithm for Dynamically Injured Hypercubes, Meshes, and Tori
—Unicast_V is a progressive, misrouting algorithm for packet or virtual cut-through networks. A progressive protocol forwards a message at an intermediate node if a nonfaulty pro...
Ming-Jer Tsai, Sheng-De Wang
TIP
2002
147views more  TIP 2002»
15 years 6 months ago
Stochastic differential equations and geometric flows
In recent years, curve evolution, applied to a single contour or to the level sets of an image via partial differential equations, has emerged as an important tool in image process...
Gozde B. Unal, Hamid Krim, Anthony J. Yezzi
MOR
2007
149views more  MOR 2007»
15 years 6 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
PPL
2007
112views more  PPL 2007»
15 years 6 months ago
Embodied Computation
The traditional computational devices and models, such as the von Neumann architecture or the Turing machine, are strongly influenced by concepts of central control and perfectio...
Heiko Hamann, Heinz Wörn
SAC
2008
ACM
15 years 6 months ago
Pattern ranking for semi-automatic ontology construction
When developing semantic applications, the construction of ontologies is a crucial part. We are developing a semiautomatic ontology construction approach, OntoCase, relying on ont...
Eva Blomqvist