Sciweavers

1609 search results - page 204 / 322
» Problem Structure and Dependable Architecture
Sort
View
ICCAD
2001
IEEE
124views Hardware» more  ICCAD 2001»
14 years 7 months ago
Partition-Based Decision Heuristics for Image Computation Using SAT and BDDs
Methods based on Boolean satisfiability (SAT) typically use a Conjunctive Normal Form (CNF) representation of the Boolean formula, and exploit the structure of the given problem ...
Aarti Gupta, Zijiang Yang, Pranav Ashar, Lintao Zh...
ITCC
2005
IEEE
14 years 4 months ago
Mining Biomedical Images with Density-Based Clustering
Density-based clustering algorithms have recently gained popularity in the data mining field due to their ability to discover arbitrary shaped clusters while preserving spatial pr...
M. Emre Celebi, Y. Alp Aslandogan, Paul R. Bergstr...
ESWS
2010
Springer
14 years 3 months ago
Replication and Versioning of Partial RDF Graphs
The sizes of datasets available as RDF (e.g., as part of the Linked Data cloud) are increasing continuously. For instance, the recent DBpedia version consists of nearly 500 million...
Bernhard Schandl
PPOPP
1999
ACM
14 years 2 months ago
Automatic Node Selection for High Performance Applications on Networks
A central problem in executing performance critical parallel and distributed applications on shared networks is the selection of computation nodes and communication paths for exec...
Jaspal Subhlok, Peter Lieu, Bruce Lowekamp
PDIS
1996
IEEE
14 years 2 months ago
Querying the World Wide Web
The World Wide Web is a large, heterogeneous, distributedcollectionof documents connected by hypertext links. The most common technologycurrently used for searching the Web depend...
Alberto O. Mendelzon, George A. Mihaila, Tova Milo