Sciweavers

473 search results - page 40 / 95
» Computing excluded minors
Sort
View
78
Voted
JSC
2000
68views more  JSC 2000»
15 years 7 days ago
New Structure Theorem for Subresultants
We give a new structure theorem for subresultants precising their gap structure and derive from it a new algorithm for computing them. If d is a bound on the degrees and a bound o...
Henri Lombardi, Marie-Françoise Roy, Mohab ...
FOCS
2010
IEEE
14 years 10 months ago
Solving Linear Systems through Nested Dissection
Abstract--The generalized nested dissection method, developed by Lipton, Rose, and Tarjan, is a seminal method for solving a linear system Ax = b where A is a symmetric positive de...
Noga Alon, Raphael Yuster
100
Voted
COLING
2010
14 years 7 months ago
Negative Feedback: The Forsaken Nature Available for Re-ranking
Re-ranking for Information Retrieval aims to elevate relevant feedbacks and depress negative ones in initial retrieval result list. Compared to relevance feedback-based re-ranking...
Yu Hong, Qing-qing Cai, Song Hua, Jian-Min Yao, Qi...
WIOPT
2011
IEEE
14 years 4 months ago
Lower bounds on the success probability for ad hoc networks with local FDMA scheduling
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
Ralph Tanbourgi, Jens P. Elsner, Holger Jäkel...
ICCV
2009
IEEE
1048views Computer Vision» more  ICCV 2009»
16 years 5 months ago
Face Recognition With Contiguous Occlusion Using Markov Random Fields
Partially occluded faces are common in many applications of face recognition. While algorithms based on sparse representation have demonstrated promising results, they achieve t...
Zihan Zhou, Andrew Wagner, Hossein Mobahi, John Wr...