61 search results - page 12 / 13 » Non-computable Julia sets |
FOCS
2008
IEEE
14 years 6 days ago
2008
IEEE
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
CEC
2005
IEEE
13 years 11 months ago
2005
IEEE
Abstract- The large majority of existing clustering algorithms are centered around the notion of a feature, that is, individual data items are represented by their intrinsic proper...
ICS
2005
Tsinghua U.
13 years 11 months ago
2005
Tsinghua U.
Learning useful and predictable features from past workloads and exploiting them well is a major source of improvement in many operating system problems. We review known parallel ...
SIGIR
1999
ACM
13 years 10 months ago
1999
ACM
Previous examinations of search in textual archives have assumed that users first retrieve a ranked set of documents relevant to their query, and then visually scan through these ...
CSL
2007
Springer
13 years 5 months ago
2007
Springer
When users access information from text, they engage in strategic fixation, visually scanning the text to focus on regions of interest. However, because speech is both serial and ...