Sciweavers

2370 search results - page 164 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
TCS
2008
14 years 10 months ago
Election and rendezvous with incomparable labels
In "Can we elect if we cannot compare" (SPAA'03), Barri`ere, Flocchini, Fraigniaud and Santoro consider a qualitative model of distributed computing, where the label...
Jérémie Chalopin
AUTOMATICA
2002
62views more  AUTOMATICA 2002»
14 years 10 months ago
On minimal-order stabilization of minimum phase plants
In this note, the problem of minimal-order stabilization in the case where the plant is minimum phase is studied. A low bound on the order of stabilizers is derived and a set of m...
Weidong Zhang, Xiaoming Xu
COMPUTING
2004
172views more  COMPUTING 2004»
14 years 10 months ago
The Convex Hull of Freeform Surfaces
We present an algorithm for computing the convex hull of freeform rational surfaces. The convex hull problem is reformulated as one of finding the zero-sets of polynomial equation...
Joon-Kyung Seong, Gershon Elber, John K. Johnstone...
67
Voted
CORR
2002
Springer
99views Education» more  CORR 2002»
14 years 10 months ago
Coin-Moving Puzzles
We introduce a new family of one-player games, involving the movement of coins from one configuration to another. Moves are restricted so that a coin can be placed only in a posit...
Erik D. Demaine, Martin L. Demaine, Helena A. Verr...
PRL
1998
142views more  PRL 1998»
14 years 9 months ago
A monothetic clustering method
: The proposed divisive clustering method performs simultaneously a hierarchy of a set of objects and a monothetic characterization of each cluster of the hierarchy. A division is ...
Marie Chavent