Sciweavers

315 search results - page 41 / 63
» An Optimal Algorithm for the Maximum-Density Segment Problem
Sort
View
COMPGEOM
2004
ACM
14 years 24 days ago
Computing the visibility graph of points within a polygon
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q ∈ P are joined by an edge if the segment pq ⊂ Q. Ef...
Boaz Ben-Moshe, Olaf Hall-Holt, Matthew J. Katz, J...
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
13 years 11 months ago
String transformation-based Bayesian classification or proteins
We describe a Markov chain Bayesian classification tool, SCS, that can perform data-driven classification of proteins and protein segments. Training data for interesting classific...
Timothy Meekhof, Gary W. Daughdrill, Robert B. Hec...
CORR
2011
Springer
147views Education» more  CORR 2011»
13 years 2 months ago
Human-Assisted Graph Search: It's Okay to Ask Questions
We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) b...
Aditya G. Parameswaran, Anish Das Sarma, Hector Ga...
ICCV
2003
IEEE
14 years 9 months ago
Graph Partition by Swendsen-Wang Cuts
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
Adrian Barbu, Song Chun Zhu
WWW
2007
ACM
14 years 8 months ago
Robust web page segmentation for mobile terminal using content-distances and page layout information
The demand of browsing information from general Web pages using a mobile phone is increasing. However, since the majority of Web pages on the Internet are optimized for browsing f...
Gen Hattori, Keiichiro Hoashi, Kazunori Matsumoto,...