Sciweavers

3244 search results - page 148 / 649
» On convex complexity measures
Sort
View
CVPR
2007
IEEE
16 years 8 months ago
Efficiently Determining Silhouette Consistency
Volume intersection is a frequently used technique to solve the Shape-From-Silhouette problem, which constructs a 3D object estimate from a set of silhouettes taken with calibrate...
Li Yi, David W. Jacobs
ICCV
2003
IEEE
16 years 8 months ago
A Caratheodory-Fejer Approach to Robust Multiframe Tracking
A requirement common to most dynamic vision applications is the ability to track objects in a sequence of frames. This problem has been extensively studied in the past few years, ...
Octavia I. Camps, Hwasup Lim, Cecilia Mazzaro, Mar...
RECOMB
2009
Springer
16 years 7 months ago
COE: A General Approach for Efficient Genome-Wide Two-Locus Epistasis Test in Disease Association Study
The availability of high density single nucleotide polymorphisms (SNPs) data has made genome-wide association study computationally challenging. Twolocus epistasis (gene-gene inter...
Xiang Zhang, Feng Pan, Yuying Xie, Fei Zou, Wei Wa...
HSNMC
2004
Springer
126views Multimedia» more  HSNMC 2004»
15 years 11 months ago
Hybrid Unicast and Multicast Flow Control: A Linear Optimization Approach
— In this paper, we present a solution to the general problem of flow control for both unicast and multicast IP networks. We formulate a convex optimization problem that can be ...
Homayoun Yousefi'zadeh, Fatemeh Fazel, Hamid Jafar...
AAAI
2007
15 years 8 months ago
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry
We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...
Subhash Suri, Elias Vicari, Peter Widmayer