Sciweavers

17366 search results - page 42 / 3474
» New Revision Algorithms
Sort
View
EOR
2007
104views more  EOR 2007»
13 years 9 months ago
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
Roberto Baldacci, Marco A. Boschetti
AAMAS
2005
Springer
13 years 9 months ago
Argumentation and the Dynamics of Warranted Beliefs in Changing Environments
One of the most difficult problems in Multi-Agent Systems (MAS) involves representing the knowledge and beliefs of an agent which performs its tasks in a dynamic environment. New p...
Marcela Capobianco, Carlos Iván Chesñ...
ICONIP
2009
13 years 7 months ago
Robust Incremental Subspace Learning for Object Tracking
In this paper, we introduce a novel incremental subspace based object tracking algorithm. The two major contributions of our work are the Robust PCA based occlusion handling scheme...
Gang Yu, Zhiwei Hu, Hongtao Lu
PPAM
2007
Springer
14 years 3 months ago
The Relevance of New Data Structure Approaches for Dense Linear Algebra in the New Multi-Core / Many Core Environments
For about ten years now, Bo K˚agstr¨om’s Group in Umea, Sweden, Jerzy Wa´sniewski’s Team at Danish Technical University in Lyngby, Denmark, and I at IBM Research in Yorktown...
Fred G. Gustavson
PVLDB
2010
129views more  PVLDB 2010»
13 years 8 months ago
Graph Pattern Matching: From Intractable to Polynomial Time
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...