question

    Date: 06/12/05 (Algorithms)    Keywords: no keywords

    given two disjoint convex geometries, what is the fastest way for finding a seperating plane?

    Source: http://www.livejournal.com/community/algorithms/56357.html

« Big Numbers that are less... || Master - Slave Replication »


antivirus | apache | asp | blogging | browser | bugtracking | cms | crm | css | database | ebay | ecommerce | google | hosting | html | java | jsp | linux | microsoft | mysql | offshore | offshoring | oscommerce | php | postgresql | programming | rss | security | seo | shopping | software | spam | spyware | sql | technology | templates | tracker | virus | web | xml | yahoo | home