Sciweavers

702 search results - page 116 / 141
» Identifying Graph Automorphisms Using Determining Sets
Sort
View
ICCCN
2007
IEEE
14 years 2 months ago
Outage Analysis of a University Campus Network
—Understanding outage and failure characteristics of a network is important to assess the availability of the network, determine failure source for trouble-shooting, and identify...
Baek-Young Choi, Sejun Song, George Koffler, Deep ...
MIR
2005
ACM
133views Multimedia» more  MIR 2005»
14 years 2 months ago
Probabilistic web image gathering
We propose a new method for automated large scale gathering of Web images relevant to specified concepts. Our main goal is to build a knowledge base associated with as many conce...
Keiji Yanai, Kobus Barnard
WCRE
2002
IEEE
14 years 1 months ago
Exposing Data-Level Parallelism in Sequential Image Processing Algorithms
As new computer architectures are developed to exploit large-scale data-level parallelism, techniques are needed to retarget legacy sequential code to these platforms. Sequential ...
Lewis B. Baumstark Jr., Linda M. Wills
FPCA
1995
14 years 2 days ago
How Much Non-Strictness do Lenient Programs Require?
Lenient languages, such as Id90, have been touted as among the best functional languages for massively parallel machines AHN88]. Lenient evaluation combines non-strict semantics w...
Klaus E. Schauser, Seth Copen Goldstein
AI
2010
Springer
13 years 8 months ago
Double preference relations for generalised belief change
Many belief change formalisms employ plausibility orderings over the set of possible worlds to determine how the beliefs of an agent ought to be modified after the receipt of a ne...
Richard Booth, Samir Chopra, Thomas Meyer, Aditya ...