Sciweavers

396 search results - page 36 / 80
» Odd Crossing Number Is Not Crossing Number
Sort
View
FOCS
1999
IEEE
15 years 2 months ago
Taking a Walk in a Planar Arrangement
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
Sariel Har-Peled
MOBIHOC
2008
ACM
15 years 9 months ago
Strong barrier coverage of wireless sensor networks
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
Benyuan Liu, Olivier Dousse, Jie Wang, Anwar Saipu...
IJCNN
2006
IEEE
15 years 3 months ago
Model Selection via Bilevel Optimization
— A key step in many statistical learning methods used in machine learning involves solving a convex optimization problem containing one or more hyper-parameters that must be sel...
Kristin P. Bennett, Jing Hu, Xiaoyun Ji, Gautam Ku...
CIKM
2008
Springer
14 years 11 months ago
Experiments with English-Persian text retrieval
As the number of non-English documents is increasing dramatically on the web nowadays, the study and design of information retrieval systems for these languages is very important....
Abolfazl AleAhmad, Hadi Amiri, Masoud Rahgozar, Fa...
GD
2003
Springer
15 years 3 months ago
Fixed-Location Circular-Arc Drawing of Planar Graphs
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
Alon Efrat, Cesim Erten, Stephen G. Kobourov