Sciweavers

1012 search results - page 47 / 203
» Segment intersection searching problems in general settings
Sort
View
WSDM
2010
ACM
211views Data Mining» more  WSDM 2010»
15 years 4 months ago
IntervalRank - Isotonic Regression with Listwise and Pairwise Constraints
Ranking a set of retrieved documents according to their relevance to a given query has become a popular problem at the intersection of web search, machine learning, and informatio...
Taesup Moon, Alex Smola, Yi Chang, Zhaohui Zheng
ISVC
2009
Springer
15 years 6 months ago
Combinatorial Preconditioners and Multilevel Solvers for Problems in Computer Vision and Image Processing
Abstract. Linear systems and eigen-calculations on symmetric diagonally dominant matrices (SDDs) occur ubiquitously in computer vision, computer graphics, and machine learning. In ...
Ioannis Koutis, Gary L. Miller, David Tolliver
AINA
2010
IEEE
15 years 4 months ago
Grid of Segment Trees for Packet Classification
—Packet classification problem has received much attention and continued to be an important topic in recent years. In packet classification problem, each incoming packet should b...
Yeim-Kuan Chang, Yung-Chieh Lin, Chen-Yu Lin
MICCAI
2010
Springer
14 years 10 months ago
Morphology-Guided Graph Search for Untangling Objects: C. elegans Analysis
We present a novel approach for extracting cluttered objects based on their morphological properties1 . Specifically, we address the problem of untangling C. elegans clusters in h...
Tammy Riklin Raviv, Vebjorn Ljosa, Annie L. Conery...
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 2 days ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy