Sciweavers

318 search results - page 19 / 64
» A New Indexing Method for Approximate String Matching
Sort
View
ICCV
2011
IEEE
13 years 9 months ago
A String of Feature Graphs Model for Recognition of Complex Activities in Natural Videos
Videos usually consist of activities involving interactions between multiple actors, sometimes referred to as complex activities. Recognition of such activities requires modeling ...
Utkarsh Gaur, Yingying Zhu, Bi Song, Amit Roy-Chow...
SODA
2001
ACM
157views Algorithms» more  SODA 2001»
14 years 11 months ago
New approaches to covering and packing problems
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...
Aravind Srinivasan
WEA
2007
Springer
108views Algorithms» more  WEA 2007»
15 years 3 months ago
Engineering Algorithms for Approximate Weighted Matching
We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a rece...
Jens Maue, Peter Sanders
SIAMJO
2010
136views more  SIAMJO 2010»
14 years 4 months ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López
INFORMATICASI
2007
89views more  INFORMATICASI 2007»
14 years 9 months ago
Approximate Representation of Textual Documents in the Concept Space
In this paper we deal with the problem of addition of new documents in collection when documents are represented in lower dimensional space by concept indexing. Concept indexing i...
Jasminka Dobsa, Bojana Dalbelo Basic