Sciweavers

2738 search results - page 486 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
MST
2000
57views more  MST 2000»
14 years 9 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
JCB
1998
129views more  JCB 1998»
14 years 9 months ago
A Sticker-Based Model for DNA Computation
We introduce a new model of molecular computation that we call the sticker model. Like many previous proposals it makes use of DNA strands as the physical substrate in which infor...
Sam T. Roweis, Erik Winfree, Richard Burgoyne, Nic...
TC
1998
14 years 9 months ago
Algorithms for Variable Length Subnet Address Assignment
In a computer network that consists of M subnetworks, the L-bit address of a machine consists of two parts: A pre x si that contains the address of the subnetwork to which the mac...
Mikhail J. Atallah, Douglas Comer
NETWORK
2007
167views more  NETWORK 2007»
14 years 9 months ago
Sensor Localization under Limited Measurement Capabilities
If we abstract a sensor network as a network graph consisting of vertices and edges, where vertices represent sensor nodes and edges represent distance measurements between neighbo...
Chen Wang, Li Xiao
PAMI
2007
185views more  PAMI 2007»
14 years 9 months ago
A Two-Level Generative Model for Cloth Representation and Shape from Shading
In this paper we present a two-level generative model for representing the images and surface depth maps of drapery and clothes. The upper level consists of a number of folds whic...
Feng Han, Song Chun Zhu