Sciweavers

774 search results - page 85 / 155
» A subdivision-based algorithm for the sparse resultant
Sort
View
ICMCS
2007
IEEE
203views Multimedia» more  ICMCS 2007»
15 years 7 months ago
Efficient Video Object Segmentation by Graph-Cut
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...
Jinjun Wang, Wei Xu, Shenghuo Zhu, Yihong Gong
APVIS
2006
15 years 2 months ago
Increasing the readability of graph drawings with centrality-based scaling
A common problem in visualising some networks is the presence of localised high density areas in an otherwise sparse graph. Applying common graph drawing algorithms on such networ...
Damian Merrick, Joachim Gudmundsson
CLEF
2010
Springer
15 years 2 months ago
DAEDALUS at WebPS-3 2010: k-Medoids Clustering Using a Cost Function Minimization
This paper describes the participation of DAEDALUS team at the WebPS-3 Task 1, regarding Web People Search. The focus of our research is to evaluate and compare the computational r...
Sara Lana-Serrano, Julio Villena-Román, Jos...
ICASSP
2008
IEEE
15 years 8 months ago
Compressed sensing - a look beyond linear programming
Recently, significant attention in compressed sensing has been focused on Basis Pursuit, exchanging the cardinality operator with the l1-norm, which leads to a linear formulation...
Christian R. Berger, Javier Areta, Krishna R. Patt...
CP
2005
Springer
15 years 7 months ago
Probabilistic Arc Consistency
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
Deepak Mehta, Marc R. C. van Dongen