19174 search results - page 3542 / 3835 » Computer Animation Techniques |
172
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
142
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...
170
click to vote
HPDC
2008
IEEE
15 years 11 months ago
2008
IEEE
If the model of free-form queries, which has proved successful for HTML based search on the Web, is made available for Grid services, it will serve as a powerful tool for scientis...
149
click to vote
ICASSP
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper investigates a class of learning problems called learning satisfiability (LSAT) problems, where the goal is to learn a set in the input (feature) space that satisfies...
132
click to vote
ICDM
2008
IEEE
15 years 11 months ago
2008
IEEE
Modern applications such as Internet traffic, telecommunication records, and large-scale social networks generate massive amounts of data with multiple aspects and high dimensiona...