3244 search results - page 148 / 649 » On convex complexity measures |
128
click to vote
CVPR
2007
IEEE
16 years 3 months ago
2007
IEEE
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...
90
Voted
ICCV
2003
IEEE
16 years 3 months ago
2003
IEEE
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, ...
126
Voted
RECOMB
2009
Springer
16 years 2 months ago
2009
Springer
The availability of high density single nucleotide polymorphisms (SNPs) data has made genome-wide association study computationally challenging. Twolocus epistasis (gene-gene inter...
114
Voted
HSNMC
2004
Springer
15 years 7 months ago
2004
Springer
— 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 ...
108
Voted
AAAI
2007
15 years 4 months ago
2007
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...