Sciweavers

1012 search results - page 20 / 203
» Segment intersection searching problems in general settings
Sort
View
FPGA
2003
ACM
137views FPGA» more  FPGA 2003»
15 years 5 months ago
Customized regular channel design in FPGAs
FPGAs are one of the essential components in platform-based embedded systems. Such systems are customized and applied only to a limited set of applications. Also some applications...
Elaheh Bozorgzadeh, Majid Sarrafzadeh
SIGIR
2004
ACM
15 years 5 months ago
Block-based web search
Multiple-topic and varying-length of web pages are two negative factors significantly affecting the performance of web search. In this paper, we explore the use of page segmentati...
Deng Cai, Shipeng Yu, Ji-Rong Wen, Wei-Ying Ma
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
15 years 1 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
CCCG
1993
15 years 1 months ago
Widest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
Ravi Janardan, Franco P. Preparata
BMCBI
2010
115views more  BMCBI 2010»
14 years 12 months ago
Multiconstrained gene clustering based on generalized projections
Background: Gene clustering for annotating gene functions is one of the fundamental issues in bioinformatics. The best clustering solution is often regularized by multiple constra...
Jia Zeng, Shanfeng Zhu, Alan Wee-Chung Liew, Hong ...