Sciweavers

1480 search results - page 203 / 296
» Ants can solve constraint satisfaction problems
Sort
View
ICMCS
2009
IEEE
180views Multimedia» more  ICMCS 2009»
15 years 4 months ago
Foreground segmentation for static video via multi-core and multi-modal graph cut
We proposed a new foreground detection method using the static cameras. It merges multi-modality into graph cut energy function, and performs much better results than conventional...
Lun-Yu Chang, Winston H. Hsu
ICCS
2005
Springer
15 years 12 months ago
Heuristic Algorithm for Anycast Flow Assignment in Connection-Oriented Networks
Abstract. Replication of content on geographically distributed servers can improve both performance and reliability of the Web service. Anycast is a one-toone-of-many delivery tech...
Krzysztof Walkowiak
RC
2002
96views more  RC 2002»
15 years 6 months ago
Verification of Invertibility of Complicated Functions over Large Domains
A new method to decide the invertibility of a given high-dimensional function over a domain is presented. The problem arises in the field of verified solution of differential algeb...
Jens Hoefkens, Martin Berz
ICRA
2010
IEEE
135views Robotics» more  ICRA 2010»
15 years 5 months ago
Implicit nonlinear complementarity: A new approach to contact dynamics
— Contact dynamics are commonly formulated as a linear complementarity problem. While this approach is superior to earlier spring-damper models, it can be inaccurate due to pyram...
Emanuel Todorov
CIKM
2011
Springer
14 years 6 months ago
Lower-bounding term frequency normalization
In this paper, we reveal a common deficiency of the current retrieval models: the component of term frequency (TF) normalization by document length is not lower-bounded properly;...
Yuanhua Lv, ChengXiang Zhai