Sciweavers

6393 search results - page 990 / 1279
» Randomized Algorithms on the Mesh
Sort
View
CORR
2004
Springer
119views Education» more  CORR 2004»
15 years 4 months ago
The Largest Compatible Subset Problem for Phylogenetic Data
Abstract. The phylogenetic tree construction is to infer the evolutionary relationship between species from the experimental data. However, the experimental data are often imperfec...
Andy Auyeung, Ajith Abraham
DAM
2000
137views more  DAM 2000»
15 years 4 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
SIGMETRICS
2002
ACM
128views Hardware» more  SIGMETRICS 2002»
15 years 4 months ago
High-density model for server allocation and placement
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
Craig W. Cameron, Steven H. Low, David X. Wei
PAMI
2007
197views more  PAMI 2007»
15 years 4 months ago
A Lattice-Based MRF Model for Dynamic Near-Regular Texture Tracking
—A near-regular texture (NRT) is a geometric and photometric deformation from its regular origin—a congruent wallpaper pattern formed by 2D translations of a single tile. A dyn...
Wen-Chieh Lin, Yanxi Liu
CORR
2010
Springer
90views Education» more  CORR 2010»
15 years 3 months ago
Perfect Omniscience, Perfect Secrecy and Steiner Tree Packing
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
Sirin Nitinawarat, Prakash Narayan