1197 search results - page 69 / 240 » Which Dynamic Constraint Problems Can Be Solved By Ants |
CVPR
2004
IEEE
14 years 11 months ago
2004
IEEE
We propose a geometric approach to 3-D motion segmentation from point correspondences in three perspective views. We demonstrate that after applying a polynomial embedding to the ...
COLING
2010
13 years 4 months ago
2010
In opinion mining of product reviews, one often wants to produce a summary of opinions based on product features/attributes. However, for the same feature, people can express it w...
COMCOM
2007
13 years 9 months ago
2007
In this paper we address the problem of constrained optimization (ILP formulation) and propose a set of heuristic algorithms for assigning light-trails [1–4,7,10] to WDM ring ne...
CCIA
2007
Springer
14 years 3 months ago
2007
Springer
With the arrival of high throughput genotyping techniques, the detection of likely genotyping errors is becoming an increasingly important problem. In this paper we are interested...
SIGECOM
2011
ACM
13 years 4 days ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...