Sciweavers

725 search results - page 25 / 145
» A General Greedy Approximation Algorithm with Applications
Sort
View
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
14 years 9 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
PODS
2011
ACM
220views Database» more  PODS 2011»
14 years 14 days ago
Maximizing conjunctive views in deletion propagation
In deletion propagation, tuples from the database are deleted in order to reflect the deletion of a tuple from the view. Such an operation may result in the (often necessary) del...
Benny Kimelfeld, Jan Vondrák, Ryan Williams
ATAL
2010
Springer
14 years 10 months ago
Asynchronous algorithms for approximate distributed constraint optimization with quality bounds
Distributed Constraint Optimization (DCOP) is a popular framework for cooperative multi-agent decision making. DCOP is NPhard, so an important line of work focuses on developing f...
Christopher Kiekintveld, Zhengyu Yin, Atul Kumar, ...
KDD
2006
ACM
159views Data Mining» more  KDD 2006»
15 years 10 months ago
Global distance-based segmentation of trajectories
This work introduces distance-based criteria for segmentation of object trajectories. Segmentation leads to simplification of the original objects into smaller, less complex primi...
Aris Anagnostopoulos, Michail Vlachos, Marios Hadj...
CVIU
2010
89views more  CVIU 2010»
14 years 9 months ago
Spherical approximation for multiple cameras in motion estimation: Its applicability and advantages
Estimating motions of a multi-camera system which may not have overlapping fields of view is generally complex and computationally expensive because of the non-zero offset between...
Jun-Sik Kim, Myung Hwangbo, Takeo Kanade