Sciweavers

1568 search results - page 245 / 314
» The problem of examination questions in algorithmics
Sort
View
INFOCOM
2009
IEEE
15 years 11 months ago
Computing the Capacity Region of a Wireless Network
—We consider a wireless network of n nodes that communicate over a common wireless medium under some interference constraints. Our work is motivated by the need for an efficient...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
BIBE
2005
IEEE
15 years 10 months ago
Selecting Informative Genes from Microarray Dataset by Incorporating Gene Ontology
Selecting informative genes from microarray experiments is one of the most important data analysis steps for deciphering biological information imbedded in such experiments. Howev...
Xian Xu, Aidong Zhang
WADS
2001
Springer
63views Algorithms» more  WADS 2001»
15 years 8 months ago
When Can You Fold a Map?
We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequenc...
Esther M. Arkin, Michael A. Bender, Erik D. Demain...
CVPR
2009
IEEE
16 years 11 months ago
Joint and Implicit Registration for Face Recognition
Contemporary face recognition algorithms rely on precise localization of keypoints (corner of eye, nose etc.). Unfortunately, finding keypoints reliably and accurately remains a...
Peng Li, Simon J. D. Prince
CVPR
2005
IEEE
16 years 6 months ago
Towards Complete Generic Camera Calibration
We consider the problem of calibrating a highly generic imaging model, that consists of a non-parametric association of a projection ray in 3D to every pixel in an image. Previous...
Srikumar Ramalingam, Peter F. Sturm, Suresh K. Lod...