Sciweavers

15485 search results - page 2492 / 3097
» Computing Optimal Subsets
Sort
View
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
15 years 11 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot
CVPR
2004
IEEE
15 years 11 months ago
Face Localization via Hierarchical CONDENSATION with Fisher Boosting Feature Selection
We formulate face localization as a Maximum A Posteriori Probability(MAP) problem of finding the best estimation of human face configuration in a given image. The a prior distribu...
Jilin Tu, ZhenQiu Zhang, Zhihong Zeng, Thomas S. H...
BROADNETS
2006
IEEE
15 years 11 months ago
SMART: An Optical Infrastructure for Future Internet
A new scalable optical network infrastructure SMART is proposed based on light-trails and hypernetwork architecture. The underlying physical network of SMART is a reconfigurable WD...
Si-Qing Zheng, Ashwin Gumaste
CAMAD
2006
IEEE
15 years 11 months ago
Enhancing reliable multicast transport to mitigate the impact of blockage
Mobile wireless communication is susceptible to signal blockage, which is loss of signal, typically due to physical obstruction, over a longer duration relative to fading. Measurem...
Stephen F. Bush, Orhan C. Imer, Praveen Kumar Gopa...
EMSOFT
2004
Springer
15 years 11 months ago
A methodology for generating verified combinatorial circuits
High-level programming languages offer significant expressivity but provide little or no guarantees about resource use. Resourcebounded languages -- such as hardware-description l...
Oleg Kiselyov, Kedar N. Swadi, Walid Taha
« Prev « First page 2492 / 3097 Last » Next »