Sciweavers

455 search results - page 89 / 91
» On Trees and Noncrossing Partitions
Sort
View
COMPGEOM
2003
ACM
14 years 29 days ago
Local polyhedra and geometric graphs
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
Jeff Erickson
ICSM
1999
IEEE
14 years 15 hour ago
A Two-Phase Process for Software Architecture Improvement
Software architecture is important for large systems in which it is the main means for, among other things, controlling complexity. Current ideas on software architectures were no...
René L. Krikhaar, André Postma, M. P...
KDD
1999
ACM
184views Data Mining» more  KDD 1999»
13 years 12 months ago
Mining Optimized Gain Rules for Numeric Attributes
—Association rules are useful for determining correlations between attributes of a relation and have applications in the marketing, financial, and retail sectors. Furthermore, op...
Sergey Brin, Rajeev Rastogi, Kyuseok Shim
COMPGEOM
2007
ACM
13 years 11 months ago
On approximate halfspace range counting and relative epsilon-approximations
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...
Boris Aronov, Sariel Har-Peled, Micha Sharir
ICMLA
2008
13 years 9 months ago
Automated Analysis for Detecting Beams in Laser Wakefield Simulations
Laser wakefield particle accelerators have shown the potential to generate electric fields thousands of times higher than those of conventional accelerators. The resulting extreme...
Daniela Mayumi Ushizima, Oliver Rübel, Prabha...