Sciweavers

409 search results - page 38 / 82
» Odd Crossing Number and Crossing Number Are Not the Same
Sort
View
IPL
2002
89views more  IPL 2002»
13 years 7 months ago
New bounds on the barycenter heuristic for bipartite graph drawing
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...
Xiao Yu Li, Matthias F. M. Stallmann
ISBI
2008
IEEE
14 years 8 months ago
On the uncertainty in sequential hypothesis testing
We consider the problem of sequential hypothesis testing when the exact pdfs are not known but instead a set of iid samples are used to describe the hypotheses. We modify the clas...
Antonio Artés-Rodríguez, Fernando P&...
FOCS
1999
IEEE
13 years 12 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
14 years 7 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
14 years 1 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...